210 search results - page 10 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
195
click to vote
PODS
2009
ACM
16 years 1 months ago
2009
ACM
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
ESA
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We present data structures for maintaining the relative convex hull of a set of points (sites) in the presence of pairwise non-crossing line segments (barriers) that subd...
125
click to vote
BIOCOMP
2006
15 years 2 months ago
2006
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
137
click to vote
SIAMCOMP
2012
13 years 3 months ago
2012
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
108
click to vote
JACM
2000
15 years 1 months ago
2000
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...