Sciweavers

2889 search results - page 352 / 578
» Querying Structured Hyperdocuments
Sort
View
ALENEX
2003
139views Algorithms» more  ALENEX 2003»
15 years 8 months ago
Interpolation over Light Fields with Applications in Computer Graphics
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
F. Betul Atalay, David M. Mount
FOCS
2008
IEEE
16 years 1 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
WWW
2001
ACM
16 years 7 months ago
Intelligent crawling on the World Wide Web with arbitrary predicates
The enormous growth of the world wide web in recent years has made it important to perform resource discovery e ciently. Consequently, several new ideas have been proposed in rece...
Charu C. Aggarwal, Fatima Al-Garawi, Philip S. Yu
SIGMOD
2004
ACM
156views Database» more  SIGMOD 2004»
16 years 6 months ago
Tree Logical Classes for Efficient Evaluation of XQuery
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
Stelios Paparizos, Yuqing Wu, Laks V. S. Lakshmana...
WWW
2003
ACM
16 years 7 months ago
Piazza: data management infrastructure for semantic web applications
The Semantic Web envisions a World Wide Web in which data is described with rich semantics and applications can pose complex queries. To this point, researchers have defined new l...
Alon Y. Halevy, Zachary G. Ives, Peter Mork, Igor ...