Sciweavers

2985 search results - page 162 / 597
» Indexing Distributed Complex Data for Complex Queries
Sort
View
CIVR
2003
Springer
269views Image Analysis» more  CIVR 2003»
15 years 10 months ago
HPAT Indexing for Fast Object/Scene Recognition Based on Local Appearance
Abstract. The paper describes a fast system for appearance based image recognition . It uses local invariant descriptors and efficient nearest neighbor search. First, local affine ...
Hao Shao, Tomás Svoboda, Tinne Tuytelaars, ...
DEXA
2006
Springer
193views Database» more  DEXA 2006»
15 years 8 months ago
Understanding and Enhancing the Folding-In Method in Latent Semantic Indexing
Abstract. Latent Semantic Indexing(LSI) has been proved to be effective to capture the semantic structure of document collections. It is widely used in content-based text retrieval...
Xiang Wang 0002, Xiaoming Jin
VLDB
2007
ACM
95views Database» more  VLDB 2007»
16 years 5 months ago
Matching Twigs in Probabilistic XML
Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and, in particular, a query may be Boolean. It is shown that for a well-known model of pro...
Benny Kimelfeld, Yehoshua Sagiv
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
16 years 6 months ago
Spatiotemporal Annotation Graph (STAG): A Data Model for Composite Digital Objects
In this demonstration, we present a database over complex documents, which, in addition to a structured text content, also has update information, annotations, and embedded object...
Smriti Yamini, Amarnath Gupta
DATESO
2009
101views Database» more  DATESO 2009»
15 years 2 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar