6251 search results - page 208 / 1251 » Randomness, Computability, and Density |
136
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
The Random Sample Consensus (RANSAC) algorithm is a popular tool for robust estimation problems in computer vision, primarily due to its ability to tolerate a tremendous fraction o...
153
click to vote
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
130
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Detection of near duplicate documents is an important problem in many data mining and information filtering applications. When faced with massive quantities of data, traditional d...
138
click to vote
RECOMB
2006
Springer
16 years 4 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
118
click to vote
CSL
2003
Springer
15 years 9 months ago
2003
Springer
Constructive dimension and constructive strong dimension are effectivizations of the Hausdorff and packing dimensions, respectively. Each infinite binary sequence A is assigned...