Sciweavers

6251 search results - page 262 / 1251
» Randomness, Computability, and Density
Sort
View
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
15 years 8 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
ICDCS
2011
IEEE
14 years 4 months ago
SpotME If You Can: Randomized Responses for Location Obfuscation on Mobile Phones
Abstract—Nowadays companies increasingly aggregate location data from different sources on the Internet to offer locationbased services such as estimating current road traffic c...
Daniele Quercia, Ilias Leontiadis, Liam McNamara, ...
ECCV
2000
Springer
16 years 6 months ago
Quasi-Random Sampling for Condensation
The problem of tracking pedestrians from a moving car is a challenging one. The Condensation tracking algorithm is appealing for its generality and potential for real-time implemen...
Vasanth Philomin, Ramani Duraiswami, Larry S. Davi...
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
16 years 6 months ago
Randomized Synopses for Query Assurance on Data Streams
The overwhelming flow of information in many data stream applications forces many companies to outsource to a third-party the deployment of a Data Stream Management System (DSMS) f...
Ke Yi, Feifei Li, Marios Hadjieleftheriou, George ...
ICPR
2002
IEEE
16 years 5 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...