16257 search results - page 2950 / 3252 » D-finiteness: algorithms and applications |
199
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
300
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...
313
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
277
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
288
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...