Sciweavers

6974 search results - page 1049 / 1395
» Querying Semi-Structured Data
Sort
View
COMPGEOM
2001
ACM
15 years 8 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
VLDB
2000
ACM
146views Database» more  VLDB 2000»
15 years 8 months ago
A Database Platform for Bioinformatics
In recent years, new developments in genetics have generated a lot of interest in genomic and proteomic data, investing international significance (and competition) in the fledgli...
Sandeepan Banerjee
CDES
2008
123views Hardware» more  CDES 2008»
15 years 6 months ago
R-tree: A Hardware Implementation
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
Xiang Xiao, Tuo Shi, Pranav Vaidya, Jaehwan John L...
LREC
2008
151views Education» more  LREC 2008»
15 years 6 months ago
A LAF/GrAF based Encoding Scheme for underspecified Representations of syntactic Annotations
Data models and encoding formats for syntactically annotated text corpora need to deal with syntactic ambiguity; underspecified representations are particularly well suited for th...
Manuel Kountz, Ulrich Heid, Kerstin Eckart
ALENEX
2003
139views Algorithms» more  ALENEX 2003»
15 years 6 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
« Prev « First page 1049 / 1395 Last » Next »