Sciweavers

385 search results - page 22 / 77
» Probabilistic ranking over relations
Sort
View
TAMC
2010
Springer
14 years 21 days ago
Algebraic Proofs over Noncommutative Formulas
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
Iddo Tzameret
QEST
2007
IEEE
14 years 1 months ago
Qualitative Logics and Equivalences for Probabilistic Systems
We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized Ctl (Qrctl): formulas o...
Luca de Alfaro, Krishnendu Chatterjee, Marco Faell...
TKDE
2010
151views more  TKDE 2010»
13 years 6 months ago
Duplicate-Insensitive Order Statistics Computation over Data Streams
—Duplicates in data streams may often be observed by the projection on a subspace and/or multiple recordings of objects. Without the uniqueness assumption on observed data elemen...
Ying Zhang, Xuemin Lin, Yidong Yuan, Masaru Kitsur...
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
14 years 7 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...
SIGIR
2005
ACM
14 years 1 months ago
Relevance weighting for query independent evidence
A query independent feature, relating perhaps to document content, linkage or usage, can be transformed into a static, per-document relevance weight for use in ranking. The challe...
Nick Craswell, Stephen E. Robertson, Hugo Zaragoza...