3874 search results - page 685 / 775 » Approximation Algorithms for k-hurdle Problems |
182
click to vote
ICDE
2011
IEEE
14 years 7 months ago
2011
IEEE
— Array database systems are architected for scientific and engineering applications. In these applications, the value of a cell is often imprecise and uncertain. There are at le...
177
Voted
FGR
2011
IEEE
14 years 7 months ago
2011
IEEE
—An expression can be approximated by a sequence of temporal segments called neutral, onset, offset and apex. However, it is not easy to accurately detect such temporal segments ...
160
click to vote
SIGMOD
2001
ACM
16 years 3 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
158
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing based image generation process. The proposed algorithm...
120
Voted
CC
2007
Springer
15 years 3 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...