210 search results - page 22 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
One of the simplest ways to query a database is through a form, where a user can fill in relevant information and obtain desired results by submitting the form. Designing good sta...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
CCCG
2006
13 years 10 months ago
2006
The problem of representing triangulations has been widely studied to obtain convenient encodings and space efficient data structures. In this paper we propose a new practical app...
EDBT
2000
ACM
14 years 7 days ago
2000
ACM
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
EDBT
2009
ACM
14 years 3 months ago
2009
ACM
This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular t...