Sciweavers

101 search results - page 12 / 21
» Consistent query answering under inclusion dependencies
Sort
View
VMCAI
2007
Springer
14 years 3 months ago
Better Under-Approximation of Programs by Hiding Variables
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Thomas Ball, Orna Kupferman
SIGMOD
1999
ACM
181views Database» more  SIGMOD 1999»
14 years 2 months ago
Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
Jeffrey Scott Vitter, Min Wang
ISMIS
1994
Springer
14 years 1 months ago
Distributed Multi-Agent Probabilistic Reasoning With Bayesian Networks
Main stream approaches in distributed artificial intelligence (DAI) are essentially logic-based. Little has been reported to explore probabilistic approach in DAI. On the other han...
Yang Xiang
PVLDB
2008
146views more  PVLDB 2008»
13 years 9 months ago
Efficient search for the top-k probable nearest neighbors in uncertain databases
Uncertainty pervades many domains in our lives. Current real-life applications, e.g., location tracking using GPS devices or cell phones, multimedia feature extraction, and sensor...
George Beskales, Mohamed A. Soliman, Ihab F. Ilyas
LREC
2010
123views Education» more  LREC 2010»
13 years 11 months ago
Querying Diverse Treebanks in a Uniform Way
This paper presents a system for querying treebanks in a uniform way. The system is able to work with both dependency and constituency based treebanks in any language. We demonstr...
Jan Stepánek, Petr Pajas