Sciweavers

5595 search results - page 1000 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
SIAMSC
2010
125views more  SIAMSC 2010»
15 years 3 months ago
A Parallel Geometric Multigrid Method for Finite Elements on Octree Meshes
Abstract. In this article, we present a parallel geometric multigrid algorithm for solving elliptic partial differential equations (PDEs) on octree based conforming finite elemen...
Rahul S. Sampath, George Biros
CVPR
2010
IEEE
15 years 8 months ago
Ray Markov Random Fields for Image-Based 3D Modeling: Model and Efficient Inference
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...
Shubao Liu, David Cooper
CC
2007
Springer
121views System Software» more  CC 2007»
15 years 5 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
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 ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
JAIR
2010
165views more  JAIR 2010»
15 years 3 months ago
A Model-Based Active Testing Approach to Sequential Diagnosis
Model-based diagnostic reasoning often leads to a large number of diagnostic hypotheses. The set of diagnoses can be reduced by taking into account extra observations (passive mon...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
ICDE
2008
IEEE
219views Database» more  ICDE 2008»
16 years 6 months ago
Never Walk Alone: Uncertainty for Anonymity in Moving Objects Databases
Preserving individual privacy when publishing data is a problem that is receiving increasing attention. According to the k-anonymity principle, each release of data must be such th...
Osman Abul, Francesco Bonchi, Mirco Nanni
« Prev « First page 1000 / 1119 Last » Next »