Sciweavers

1937 search results - page 137 / 388
» Conditioning Probabilistic Databases
Sort
View
FLAIRS
2009
14 years 8 months ago
Mining Default Rules from Statistical Data
In this paper, we are interested in the qualitative knowledge that underlies some given probabilistic information. To represent such qualitative structures, we use ordinal conditi...
Gabriele Kern-Isberner, Matthias Thimm, Marc Finth...
ICVS
1999
Springer
15 years 3 months ago
Action Reaction Learning: Automatic Visual Analysis and Synthesis of Interactive Behaviour
We propose Action-Reaction Learning as an approach for analyzing and synthesizing human behaviour. This paradigm uncovers causal mappings between past and future events or between...
Tony Jebara, Alex Pentland
94
Voted
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
15 years 11 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons
100
Voted
ICDT
2005
ACM
139views Database» more  ICDT 2005»
15 years 4 months ago
First Order Paths in Ordered Trees
We give two sufficient conditions on XPath like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled t...
Maarten Marx
IDEAS
2002
IEEE
135views Database» more  IDEAS 2002»
15 years 3 months ago
On Implicate Discovery and Query Optimization
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
Kristofer Vorwerk, G. N. Paulley