1349 search results - page 195 / 270 » Models for Incomplete and Probabilistic Information |
169
click to vote
IACR
2011
14 years 5 months ago
2011
In the area of privacy-preserving data mining, a differentially private mechanism intuitively encourages people to share their data truthfully because they are at little risk of ...
179
click to vote
SDM
2003
SIAM
15 years 7 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
197
click to vote
AAAI
2012
13 years 8 months ago
2012
This paper addresses the problem of automated advice provision in settings that involve repeated interactions between people and computer agents. This problem arises in many real ...
132
click to vote
ICIP
2005
IEEE
16 years 7 months ago
2005
IEEE
We present a novel and intuitive framework for building modular vision systems for complex tasks such as surveillance applications. Inspired by graphical models, especially factor...
159
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...