Sciweavers

5221 search results - page 266 / 1045
» An On-line Problem Database
Sort
View
ICDE
2005
IEEE
139views Database» more  ICDE 2005»
16 years 8 months ago
Compressing Bitmap Indices by Data Reorganization
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu
ICPR
2006
IEEE
16 years 7 months ago
Forest Extension of Error Correcting Output Codes and Boosted Landmarks
In this paper, we introduce a robust novel approach for detecting objects category in cluttered scenes by generating boosted contextual descriptors of landmarks. In particular, ou...
Oriol Pujol, Petia Radeva, Sergio Escalera
PODS
2009
ACM
122views Database» more  PODS 2009»
16 years 7 months ago
Satisfiability of downward XPath with data equality tests
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
Diego Figueira
182
Voted
DASFAA
2006
IEEE
135views Database» more  DASFAA 2006»
15 years 10 months ago
An Efficient Co-operative Framework for Multi-query Processing over Compressed XML Data
XML is a de-facto standard for exchanging and presenting information on the Web. However, XML data is also recognized as verbose since it heavily inflates the size of the data due ...
Juzhen He, Wilfred Ng, Xiaoling Wang, Aoying Zhou
VLDB
2000
ACM
166views Database» more  VLDB 2000»
15 years 10 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...