Sciweavers

409 search results - page 30 / 82
» Compact Similarity Joins
Sort
View
DGCI
2005
Springer
14 years 1 months ago
Geometric Robot Mapping
Abstract. The purpose of this paper is to present a technique to create a global map of a robot’s surrounding by converting the raw data acquired from a scanning sensor to a comp...
Rolf Lakämper, Longin Jan Latecki, Xinyu Sun,...
NIPS
2008
13 years 9 months ago
Spectral Hashing
Semantic hashing[1] seeks compact binary codes of data-points so that the Hamming distance between codewords correlates with semantic similarity. In this paper, we show that the p...
Yair Weiss, Antonio Torralba, Robert Fergus
AAAI
2006
13 years 9 months ago
Decision Tree Methods for Finding Reusable MDP Homomorphisms
straction is a useful tool for agents interacting with environments. Good state abstractions are compact, reuseable, and easy to learn from sample data. This paper and extends two...
Alicia P. Wolfe, Andrew G. Barto
CVPR
2008
IEEE
14 years 9 months ago
Learning human actions via information maximization
In this paper, we present a novel approach for automatically learning a compact and yet discriminative appearance-based human action model. A video sequence is represented by a ba...
Jingen Liu, Mubarak Shah
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
14 years 9 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...