663 search results - page 29 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
COMPGEOM
1998
ACM
14 years 18 hour ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
DICTA
2003
13 years 9 months ago
2003
In this paper, we propose a robust method to estimate the fundamental matrix in the presence of outliers. The new method uses random minimum subsets as a search engine to find inli...
PVLDB
2010
13 years 6 months ago
2010
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...
AIIA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The huge volume of gene expression data produced by microarrays and other high-throughput techniques has encouraged the development of new computational techniques to eva...