4860 search results - page 548 / 972 » SNPs Problems, Complexity, and Algorithms |
143
click to vote
EDBT
2000
ACM
15 years 8 months ago
2000
ACM
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
149
click to vote
WSCG
2003
15 years 6 months ago
2003
The computation of global illumination in a dynamic scene constitutes a real challenge in computer graphics. In radiosity algorithms, this problem is far from being easy, especial...
141
click to vote
CGF
2008
15 years 4 months ago
2008
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
335
click to vote
PAMI
2010
15 years 3 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
144
click to vote
ICVS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Nearest Neighbor Search (NNS) is employed by many computer vision algorithms. The computational complexity is large and constitutes a challenge for real-time capability. ...