Sciweavers

1233 search results - page 120 / 247
» Extensible Point Location Algorithm
Sort
View
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
15 years 8 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
EDBT
2009
ACM
172views Database» more  EDBT 2009»
15 years 7 months ago
Continuous visible nearest neighbor queries
In this paper, we identify and solve a new type of spatial queries, called continuous visible nearest neighbor (CVNN) search. Given a data set P, an obstacle set O, and a query li...
Yunjun Gao, Baihua Zheng, Wang-Chien Lee, Gencai C...
112
Voted
PRL
2008
118views more  PRL 2008»
15 years 2 months ago
Bayes Machines for binary classification
In this work we propose an approach to binary classification based on an extension of Bayes Point Machines. Particularly, we take into account the whole set of hypotheses that are...
Daniel Hernández-Lobato, José Miguel...
AVSS
2009
IEEE
15 years 11 days ago
3D Face Recognition Using Multiview Keypoint Matching
A novel algorithm for 3D face recognition based point cloud rotations, multiple projections, and voted keypoint matching is proposed and evaluated. The basic idea is to rotate eac...
Michael Mayo, Edmond Zhang
GLOBECOM
2008
IEEE
15 years 9 months ago
A Memory-Optimized Bloom Filter Using an Additional Hashing Function
— A Bloom filter is a simple space-efficient randomized data structure for the representation set of items in order to support membership queries. In recent years, Bloom filte...
Mahmood Ahmadi, Stephan Wong