Sciweavers

1096 search results - page 79 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
APPROX
2010
Springer
133views Algorithms» more  APPROX 2010»
15 years 1 months ago
Liftings of Tree-Structured Markov Chains - (Extended Abstract)
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
Thomas P. Hayes, Alistair Sinclair
NIPS
2004
15 years 7 months ago
An Investigation of Practical Approximate Nearest Neighbor Algorithms
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Y...
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
16 years 6 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
ICCV
2003
IEEE
15 years 11 months ago
A Model-Based Approach for Automated Feature Extraction in Fundus Images
A new approach to automatically extract the main features in color fundus images are proposed in this paper. Optic disk is localized by the principal component analysis (PCA) and ...
Huiqi Li, Opas Chutatape
CVPR
2007
IEEE
16 years 20 days ago
Hierarchical Structuring of Data on Manifolds
Manifold learning methods are promising data analysis tools. However, if we locate a new test sample on the manifold, we have to find its embedding by making use of the learned e...
Jun Li, Pengwei Hao