929 search results - page 148 / 186 » Answering imprecise database queries: a novel approach |
207
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
COCO
2003
Springer
15 years 5 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
SSD
2009
Springer
15 years 6 months ago
2009
Springer
With the exponential growth of moving objects data to the Gigabyte range, it has become critical to develop effective techniques for indexing, updating, and querying these massive ...
CGI
1998
IEEE
15 years 4 months ago
1998
IEEE
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
105
click to vote
DEXA
2010
Springer
15 years 28 days ago
2010
Springer
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...