1262 search results - page 134 / 253 » Fast Robust Hashing |
133
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
Median-shift is a mode seeking algorithm that relies on
computing the median of local neighborhoods, instead of
the mean. We further combine median-shift with Locality
Sensitive...
205
click to vote
ICDE
2001
IEEE
16 years 4 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
120
click to vote
DAC
2006
ACM
16 years 4 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
155
click to vote
IROS
2008
IEEE
15 years 9 months ago
2008
IEEE
— This paper presents a vision based method for grasp classification. It is developed as part of a Programming by Demonstration (PbD) system for which recognition of objects and...
129
click to vote
ICNP
2006
IEEE
15 years 9 months ago
2006
IEEE
— Binding services are crucial building blocks in networks and networked applications. A binding service (e.g., the Domain Name System (DNS)) maps certain information, namely, bi...