Sciweavers

267 search results - page 52 / 54
» On the approximability of influence in social networks
Sort
View
AAAI
2011
12 years 5 months ago
Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
Chloe Kiddon, Pedro Domingos
NETGAMES
2006
ACM
13 years 11 months ago
Post-game estimation of game client RTT and hop count distributions
In first person shooter (FPS) games the round trip time (RTT) (delay, or ‘lag’) between a client and server is an important criterion for players when deciding which server to ...
Grenville J. Armitage, Carl Javier, Sebastian Zand...
ATAL
2008
Springer
13 years 7 months ago
Decentralised coordination of low-power embedded devices using the max-sum algorithm
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
Alessandro Farinelli, Alex Rogers, Adrian Petcu, N...
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 6 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
TITB
2008
204views more  TITB 2008»
13 years 5 months ago
A Cryptographic Approach to Securely Share and Query Genomic Sequences
To support large-scale biomedical research projects, organizations need to share person-specific genomic sequences without violating the privacy of their data subjects. In the past...
Murat Kantarcioglu, Wei Jiang, Ying Liu, Bradley M...