Sciweavers

860 search results - page 18 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 8 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
ICLP
2007
Springer
13 years 11 months ago
User-Definable Resource Bounds Analysis for Logic Programs
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
Jorge Navas, Edison Mera, Pedro López-Garc&...
ET
2006
55views more  ET 2006»
13 years 7 months ago
Test Planning and Test Resource Optimization for Droplet-Based Microfluidic Systems
Recent years have seen the emergence of dropletbased microfluidic systems for safety-critical biomedical applications. In order to ensure reliability, microsystems incorporating m...
Fei Su, Sule Ozev, Krishnendu Chakrabarty
FCT
2009
Springer
14 years 2 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
TIT
2008
102views more  TIT 2008»
13 years 7 months ago
Average Stopping Set Weight Distributions of Redundant Random Ensembles
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
Tadashi Wadayama