Sciweavers

5785 search results - page 578 / 1157
» Approximability of Probability Distributions
Sort
View
AAAI
2012
13 years 9 months ago
Evaluating Resistance to False-Name Manipulations in Elections
In many mechanisms (especially online mechanisms), a strategic agent can influence the outcome by creating multiple false identities. We consider voting settings where the mechan...
Bo Waggoner, Lirong Xia, Vincent Conitzer
STOC
2002
ACM
177views Algorithms» more  STOC 2002»
16 years 7 months ago
Similarity estimation techniques from rounding algorithms
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
Moses Charikar
MOBIHOC
2008
ACM
16 years 6 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao
MOBIHOC
2007
ACM
16 years 6 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
QEST
2009
IEEE
16 years 1 months ago
Comparison of Two Output Models for the BMAP/MAP/1 Departure Process
—The departure process of a BMAP/MAP/1 queue can be approximated in different ways: as a Markovian arrival process (MAP) or as a matrix-exponential process (MEP). Both approximat...
Qi Zhang, Armin Heindl, Evgenia Smirni, Andreas St...