Sciweavers

7167 search results - page 161 / 1434
» Answer Set Programming
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 11 months ago
Lower bound for deterministic semantic-incremental branching programs solving GEN
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...
Dustin Wehr
SIGMOD
2005
ACM
215views Database» more  SIGMOD 2005»
16 years 4 months ago
Nested intervals tree encoding in SQL
Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without acc...
Vadim Tropashko
ISAAC
2007
Springer
118views Algorithms» more  ISAAC 2007»
15 years 11 months ago
Dynamic Structures for Top- k Queries on Uncertain Data
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...
Jiang Chen, Ke Yi
PAKDD
2004
ACM
83views Data Mining» more  PAKDD 2004»
15 years 10 months ago
Providing Diversity in K-Nearest Neighbor Query Results
Abstract. Given a point query Q in multi-dimensional space, K-Nearest Neighbor (KNN) queries return the K closest answers in the database with respect to Q. In this scenario, it is...
Anoop Jain, Parag Sarda, Jayant R. Haritsa
DBSEC
2003
137views Database» more  DBSEC 2003»
15 years 6 months ago
Certifying Data from Multiple Sources
Abstract Data integrity can be problematic when integrating and organizing information from many sources. In this paper we describe efficient mechanisms that enable a group of data...
Glen Nuckolls, Charles U. Martel, Stuart G. Stubbl...