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 21 for “"number of queries"”.
-
Locally decodable source coding
Source coding is accomplished via the mapping of consecutive source symbols (blocks) into code blocks of fixed or variable length. The fundamental limits in source coding introduces a tradeoff between the rate of compression and the fidelity of the recovery. However, in practical communication …
-
Smarter with Smartphones
… Learning by searching the web has been subject of scientific research for the past decade and this research resulted in the Information Problem Solving while using the Internet model (IPS-I model) (Brand-Gruwel et al., 2009). Search success is, among other things, influenced by the query length …
-
Multicore construction of k-d trees with applications in graphics and vision
… for accelerating retrieval from large sets of geometric entities in R^k. Despite speeding up an otherwise brute force search, the time to construct and traverse the k-d tree remain a bottleneck in many applications. Increasing parallelism in modern processors offers hope for further …
-
Property testing : theory and applications
… problem and for specific partial orders. A few of our intermediate results are of independent interest. 1. If strings with a property form a vector space, adaptive 2-sided error tests for the property have no more power than non-adaptive 1-sided error tests. 2. Random LDPC codes with linear …
-
Descriptive analysis of the musculoskeletal case load referred for ultrasound imaging in an Auckland imaging practice : a case study
… (MSK US) imaging provides visualisation of a large number of superficial anatomical structures including nerves, joints, ligaments, tendons and muscles. The utility of ultrasound has been compared to other common imaging techniques such as Magnetic Resonance Imaging (MRI,) and is proving …
-
Learning hypertrees with shortest path queries
One branch of computational learning theory focuses on algorithms for learning discrete structured objects from queries. In this context, we consider the problem of learning a labeled hypergraph from a given family of hypergraphs using shortest path (SP) queries. An SP query specifies two vertices …
-
Testability of linear-invariant properties
Property Testing is the study of super-efficient algorithms that solve "approximate decision problems" with high probability. More precisely, given a property P, a testing algorithm for P is a randomized algorithm that makes a small number of queries into its input and distinguishes between whether …
-
New sublinear methods in the struggle against classical problems
We study the time and query complexity of approximation algorithms that access only a minuscule fraction of the input, focusing on two classical sources of problems: combinatorial graph optimization and manipulation of strings. The tools we develop find applications outside of the area of sublinear …
-
Query K-means clustering for crowdsourcing
… and $\delta\in(0,1)$, using an expected number of $O(\frac{K^3}{\epsilon \delta})$ noiseless same-cluster queries and comparison-based clustering of complexity $O(ndK + \frac{K^3}{\epsilon \delta})$; here, $n$ denotes the number of points and $d$ the dimension of space. Compared to a …
-
Private sequential search and optimization
… analyze two models to study an intrinsic trade-off between privacy and query complexity in online settings: 1. Our first private optimization model involves an agent aiming to minimize an objective function expressed as a weighted sum of finitely many convex cost functions, where the weights …
-
Enabling human-multi-robot collaborative visual exploration in underwater environments
… situ. The robots model the spatial distribution of various habitats and terrain types in the environment using semantic classes learned online, and send image queries to the supervisor to learn which of these classes are associated with the highest concentration of targets of interest. The robots …
-
Enabling Human-Multi-Robot Collaborative Visual Exploration in Underwater Environments
… situ. The robots model the spatial distribution of various habitats and terrain types in the environment using semantic classes learned online, and send image queries to the supervisor to learn which of these classes are associated with the highest concentration of targets of interest. The robots …
-
New error correcting codes from lifting
… protecting information from noise. The theory of error correcting codes studies the range of parameters achievable by such codes, as well as the efficiency with which one can encode and decode them. In recent years, attention has focused on the study of sublinear-time algorithms for various …
-
Visualization and differential privacy
… about an individual from statistical database queries. Recent state-of-the-art Privacy-Enhancing Technologies (PETs) often implement noise injection based mechanisms in order to satisfy a strong DP protection level. While these privacy protection guidelines minimize risks of private information …
-
Lines in Hales-Jewett cubes and other combinatorial results
In Chapter 1, we are concerned with the number of lines a set S <;;;; [n]d of a given size can contain. Here, a line in [n]d means a 'geometric line ', i.e. a set { x(ll, ... , x(n)} of n elements of [n]d such that for each 1 :::; i :::; d, the sequence x?), ... , x~n) is either strictly increasing …
-
Quantum Information Processing with Continuous Variables and Atomic Ensembles
… result addresses the theoretical foundations of quantum metrology. It is now well known that quantum-enhanced metrology promises improved sensitivity in parameter estimation over classical measurement procedures. The Heisenberg limit is considered to be the ultimate limit in quantum metrology …
-
SEQUENTIAL DECISION MAKING FOR ACTIVE LEARNING AND INFERENCE IN ONLINE SETTINGS
… data points to learn from with the objective of label efficiency In this dissertation, we first focus on designing active learning algorithms for active inference. We consider an anomaly detection problem among heterogeneous processes. At each time, a subset of processes can be probed. The …
-
Systematic optimization of search engines for difficult queries
With the advent of Web, text information is being generated across the globe at an unfathomable rate and covering countless topics. This dramatic growth in text information and the increasing number of ways people can utilize it has influenced our daily lives in fundamental and profound ways. The …
-
Balanced allocations under incomplete information: New settings and techniques
… 𝑚 balls to be allocated into 𝑛 bins with the aim of minimising the maximum load of any of the bins, or equivalently minimising the 𝑔𝑎𝑝, i.e., the difference between the maximum load and the average load. In this dissertation, we focus on the ℎ𝑒𝑎𝑣𝑖𝑙𝑦-𝑙𝑜𝑎𝑑𝑒𝑑 𝑐𝑎𝑠𝑒 where 𝑚 ≫ 𝑛, which tends to be more …
-
Leveraging user interaction to improve search experience with difficult and exploratory queries
… the effective differentiator terms to make their queries specific and precise. In reality, however, a large number of queries are problematic return either too many or no relevant documents in the initial search results. Existing search systems provide no assistance to the users when they cannot …
Page 1 of 2