Sciweavers

1887 search results - page 305 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
LWA
2008
13 years 9 months ago
Labeling Clusters - Tagging Resources
In order to support the navigation in huge document collections efficiently, tagged hierarchical structures can be used. Often, multiple tags are used to describe resources. For u...
Korinna Bade, Andreas Nürnberger
SDM
2007
SIAM
145views Data Mining» more  SDM 2007»
13 years 9 months ago
Finding Motifs in a Database of Shapes
The problem of efficiently finding images that are similar to a target image has attracted much attention in the image processing community and is rightly considered an informatio...
Xiaopeng Xi, Eamonn J. Keogh, Li Wei, Agenor Mafra...
CRYPTO
2010
Springer
157views Cryptology» more  CRYPTO 2010»
13 years 9 months ago
Oblivious RAM Revisited
We reinvestigate the oblivious RAM concept introduced by Goldreich and Ostrovsky, which enables a client, that can store locally only a constant amount of data, to store remotely ...
Benny Pinkas, Tzachy Reinman
IVC
2006
161views more  IVC 2006»
13 years 7 months ago
Applications of moving windows technique to autonomous vehicle navigation
A `Moving Window' scheme for detecting lanes, obstacles and corridor environments from the images captured by a CCD camera in an automobile or mobile robot is proposed. Proce...
Sung Yug Choi, Jang Myung Lee
ESA
2008
Springer
99views Algorithms» more  ESA 2008»
13 years 9 months ago
Robust Kinetic Convex Hulls in 3D
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, ...