Sciweavers

978 search results - page 81 / 196
» Knowledge, Probability, and Adversaries
Sort
View
ECCV
2002
Springer
15 years 11 months ago
Probabilistic Search for Object Segmentation and Recognition
Abstract. The problem of searching for a model-based scene interpretation is analyzed within a probabilistic framework. Object models are formulated as generative models for range ...
Ulrich Hillenbrand, Gerd Hirzinger
MOBIHOC
2008
ACM
15 years 9 months ago
Routing in a cyclic mobispace
A key challenge of routing in delay tolerant networks (DTNs) is to find routes that have high delivery rates and low endto-end delays. When oracles are not available for future co...
Cong Liu, Jie Wu
UAI
2003
14 years 11 months ago
Updating with incomplete observations
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental pro...
Gert de Cooman, Marco Zaffalon
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
14 years 11 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
WWW
2009
ACM
15 years 10 months ago
To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles
In order to address privacy concerns, many social media websites allow users to hide their personal profiles from the public. In this work, we show how an adversary can exploit an...
Elena Zheleva, Lise Getoor