Sciweavers

217 search results - page 30 / 44
» On the Fine Structure of Large Search Spaces
Sort
View
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
13 years 2 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
IJCV
2008
157views more  IJCV 2008»
14 years 11 months ago
Pairwise Matching of 3D Fragments Using Cluster Trees
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
Simon Winkelbach, Friedrich M. Wahl
EDBT
2004
ACM
133views Database» more  EDBT 2004»
15 years 11 months ago
HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
Ralf Schenkel, Anja Theobald, Gerhard Weikum
PCI
2009
Springer
15 years 4 months ago
Exploring Gadget-Based Interfaces for the Social Semantic Desktop
— A large number of tools has recently emerged supporting information management for individuals in their social context. Semantic technologies play an important role in the deve...
Konstantinos Christidis, Niki Papailiou, Gregoris ...
EH
2002
IEEE
111views Hardware» more  EH 2002»
15 years 4 months ago
Towards Development in Evolvable Hardware
Mapping between genotype and phenotype using a model of biological development has been widely touted as a technique for evolving solutions to large, complex problems [1-3]. Here ...
Timothy G. W. Gordon, Peter J. Bentley