Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 51 for “"Online algorithm"”.
-
Online packet buffering
… of computer networks. We develop and investigate algorithms for temporary data packet buffering, where information about the packets is not completely known in advance, but arrives by and by over time. In the classical approach of designing algorithms, all data are assumed to be known in advance. …
-
Primal-Dual Techniques for Online Algorithms and Mechanisms
An offline algorithm is one that knows the entire input in advance. An online algorithm, however, processes its input in a serial fashion. In contrast to offline algorithms, an online algorithm works in a local fashion and has to make irrevocable decisions without having the entire input. Online …
-
Empirical Analysis of Algorithms for the k-Server and Online Bipartite Matching Problems
… we present an empirical analysis of a new online algorithm for k-server problem. This algorithm maintains two solutions, online solution, and an approximately optimal offline solution. When a request arrives we update the offline solution and use this update to inform the online assignment. …
-
Extending the Birkhoff-von Neumann switching strategy to multicast switching
… flows in the N x N switch is O(logN). The algorithm naturally leads to a schedule to serve the flows in a stable manner, if the rates are achievable. For an arbitrary number of multicasts, we show that, computing the offline schedule is equivalent to fractional weighted graph coloring which …
-
Finding important entities in continuous streaming data
… formulation. In addition, we present a novel online algorithm for heavy hitters, called HAC, which addresses problems in continuous space, and demonstrate its effectiveness on real video and household domains.
-
EFFICIENT DATA CURATION AND UTILIZATION FOR DEEP LEARNING
… settings, we introduce InfoGrowth, an efficient online algorithm for data cleaning and selection that maintains cleanliness and diversity as data grow. Finally, we present Info-Coevolution, a bias-free framework for online selective annotation that enables models and data to coevolve, reducing …
-
Discovering user context with mobile devices : location and time
… We base our approach on an existing graph-based online algorithm, but modify it to compute additional statistics for offline analysis to obtain better results. We then further refine the offline algorithm to include time-partitioned nodes to resolve some observed shortcomings. Finally, we …
-
Efficient zero-knowledge range arguments and privacy-preserving applications
… group purchasing, which includes a competitive online algorithm for decision-making, secure multi-party computation for enhancing privacy, and zero-knowledge proofs on the blockchain for verifying the private input data used in our online algorithm. Second, we propose a novel scheme zk-qrcode …
-
Efficient zero-knowledge range arguments and privacy-preserving applications
… group purchasing, which includes a competitive online algorithm for decision-making, secure multi-party computation for enhancing privacy, and zero-knowledge proofs on the blockchain for verifying the private input data used in our online algorithm. Second, we propose a novel scheme zk-qrcode …
-
Optimization problems in networks and queues
… second problem considers the dynamic batching of online arrivals, a problem motivated by service systems and data-processing applications where larger batches enjoy economies of scale. The work formalizes the tradeoff between waiting costs and batch-processing efficiency and establishes both a …
-
Online optimization in routing and scheduling
In this thesis we study online optimization problems in routing and scheduling. An online problem is one where the problem instance is revealed incrementally. Decisions can (and sometimes must) be made before all information is available. We design and analyze (polynomial-time) online algorithms …
-
Nonparametric Bayesian methods for supervised and unsupervised learning
… the other way around. The second method is an online algorithm for learning a prototype-based model for categorial concepts, and can be used to solve problems of multiclass classification with missing features. I apply it to problems of categorizing newsgroup posts and recognizing handwritten …
-
Reducing the computational demands of medical monitoring classifiers by examining less data
… powered by small batteries. Since classification algorithms often perform energy-intensive signal analysis, power management techniques are needed to achieve reasonable battery lifetimes. In this thesis, we describe software-based methods that reduce the computation, and thus, energy consumption …
-
Optimization in stochastic models of network applications
… models and develop optimal or near-optimal algorithms for resource allocation, for two important network applications: 1) video-on-demand (VoD) services in content distribution networks (CDNs) and 2) online advertising. For the first application, we address the problem of content placement …
-
Online scheduling algorithms for average flow time and its variants
… and fairness. A popular performance measure for online scheduling algorithms is competitive ratio. An algorithm is said to be $c$-competitive if its objective is within a multiplicative factor $c$ of the optimal scheduler's objective for any sequence of requests. Roughly speaking, an algorithm …
-
Online algorithms for content caching: an economic perspective
… The current literature either proposes offline algorithms that have complete knowledge of the request profile a priori, or proposes heuristics without provable performance. In this dissertation, online algorithms are presented for content caching in three different network settings: the current …
-
Learning to map sentences to logical form
… analyzed in isolation. We describe a learning algorithm that takes as input a training set of sentences labeled with expressions in the lambda calculus. The algorithm induces a Combinatory Categorial Grammar (CCG) for the problem, along with a log-linear model that represents a distribution …
-
Cooperative checkpointing for supercomputing systems
… checkpointing, and models its behavior as an online algorithm. Where C is the checkpoint overhead and I is the request interval, a worst-case analysis proves a lower bound of (2 + [C/I])-competitiveness for deterministic cooperative checkpointing algorithms, and proves that a number of simple …
-
Fulfillment algorithm for integrating stock between brick and mortar and E-commerce
This thesis proposes a novel fulfillment algorithm which maximizes profits and customer experience through optimal distribution in a multi-period setting for a set of shipping locations that includes both stores and online-only warehouses. Myopic methods do not account for the temporal aspects of …
-
Linear regression analysis of 2D projection image data of 6 degrees-of-freedom transformed 3D image sets for stereotactic radiation therapy
… independent transformations of the volume. The algorithm calculates the 6-DoF transformation of the patient based upon two orthogonal real-time 2D images by correlating the images against the base set The algorithm has positioning accuracy to at least 1 pixel, equivalent to 0.5098 mm accuracy …
Page 1 of 3