Sciweavers

3341 search results - page 508 / 669
» On Bounded Queries and Approximation
Sort
View
ADC
2009
Springer
98views Database» more  ADC 2009»
16 years 1 months ago
Elliptic Indexing of Multidimensional Databases
In this work an R-tree variant, which uses minimum volume covering ellipsoids instead of usual minimum bounding rectangles, is presented. The most significant aspects, which dete...
Ondrej Danko, Tomás Skopal
ICALP
2007
Springer
16 years 19 days ago
Private Locally Decodable Codes
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
Rafail Ostrovsky, Omkant Pandey, Amit Sahai
WAIM
2007
Springer
16 years 18 days ago
An Efficient Spatial Search Method Based on SG-Tree
To solve the overlapping search of multidimensional spatial database containing large quantity of objects with dynamic spatial extent, this paper proposes an index structure named ...
Yintian Liu, Changjie Tang, Lei Duan, Tao Zeng, Ch...
WEBI
2007
Springer
16 years 18 days ago
An unsupervised hierarchical approach to document categorization
— We propose a hierarchical approach to document categorization that requires no pre-configuration and maps the semantic document space to a predefined taxonomy. The utilizatio...
Robert Wetzker, Tansu Alpcan, Christian Bauckhage,...
INFOCOM
2006
IEEE
16 years 15 days ago
Information Dissemination in Power-Constrained Wireless Networks
— Dissemination of common information through broadcasting is an integral part of wireless network operations such as query of interested events, resource discovery and code upda...
Rong Zheng