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 11 of 11 for “"Sketching algorithms"”.
-
Space-efficient data sketching algorithms for network applications
Sketching techniques are widely adopted in network applications. Sketching algorithms “encode” data into succinct data structures that can later be accessed and “decoded” for various purposes, such as network measurement, accounting, anomaly detection and etc. Bloom filters and counter braids are …
-
Aperture: a system for interactive visualization of voluminous geospatial data
… these challenges relies on a novel mix of algorithms and systems innovations working in concert to ensure effective apportioning and amortization of workloads and enables interactivity during visualizations. In particular our research prototype, Aperture, leverages sketching algorithms, …
-
Sketching as a Tool for Efficient Networked Systems
… systems constructed with conventional in-memory algorithms face the following challenges: (1) excessive resource requirements (e.g., CPU, ASIC, and memory) with high cost; (2) infeasibility in a larger scale; (3) processing the data too slowly to meet the objectives. To address these challenges, …
-
Convex optimization with combinatorial characteristics: new algorithms for linear programming, min-cost flow, and other structured problems
… of two approaches: 1). Design problem-specific algorithms that are combinatorial in nature and make use of structures in the underlying discrete object, and 2). Cast the problem as a general optimization problem, typically a linear program (LP), and apply a general-purpose LP solver. My work …
-
Bayesian and machine learning models for dependent data with applications to official statistics and survey methodology
… of individuals. We introduce Bayesian data sketching algorithms to compress high-dimensional survey data at both the area level and the unit level onto a lower-dimension subspace using random projection matrices. This framework relies on the Bayesian pseudo-likelihood to accommodate the …
-
High Dimensional Data Analysis With Dependency and Under Limited Memory
… to several areas like random projection, sketching algorithms for fast computation for tensor regression.
-
Enabling parallelism and optimizations in data mining algorithms for power-law data
… algorithmic advances, such as fast approximate algorithms and efficient learning algorithms, and b) architectural advances, such as machines with massive compute capacity involving distributed multi-core processors and high throughput accelerators. For current and future generation processors, …
-
STREAMING ALGORITHMS FOR MINING FREQUENT ITEMS
… restriction. Although the majority of the algorithms are randomized and approximate, the field facilitates numerous applications from handling networking traffic to analyzing cosmology simulations and beyond. This thesis focuses on one of the most foundational and well-studied problems of …
-
Kernel Sum Sketches for Large Scale Learning
… role in machine learning and statistics, but algorithms for such methods scale poorly to large, high-dimensional datasets. Kernel sum computations are often the bottleneck, as they must aggregate all pairwise interactions between a query and each element of the dataset. Prior research has …