Sciweavers

4965 search results - page 769 / 993
» A Simple Abstraction for Data Modeling
Sort
View
EDBT
2006
ACM
255views Database» more  EDBT 2006»
16 years 6 months ago
FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
Elke Achtert, Dominik Schwald
DASFAA
2009
IEEE
133views Database» more  DASFAA 2009»
16 years 1 months ago
Probabilistic Ranking in Uncertain Vector Spaces
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
ADMA
2009
Springer
142views Data Mining» more  ADMA 2009»
16 years 1 months ago
Crawling Deep Web Using a New Set Covering Algorithm
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
Yan Wang, Jianguo Lu, Jessica Chen
FMCAD
2009
Springer
16 years 1 months ago
Decision diagrams for linear arithmetic
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...
Sagar Chaki, Arie Gurfinkel, Ofer Strichman
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...