735 search results - page 5 / 147 » Evaluating Probabilistic Queries over Imprecise Data |
167
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
125
click to vote
ICDE
2011
IEEE
14 years 1 months ago
2011
IEEE
— Although efficient processing of probabilistic databases is a well-established field, a wide range of applications are still unable to benefit from these techniques due to t...
EDBT
2010
ACM
14 years 11 months ago
2010
ACM
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
171
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
183
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...