Sciweavers

1778 search results - page 277 / 356
» On the Power of the Randomized Iterate
Sort
View
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
16 years 6 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
ICS
2010
Tsinghua U.
16 years 3 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
CVPR
2010
IEEE
16 years 2 months ago
Energy Minimization for Linear Envelope MRFs
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new rep...
Pushmeet Kohli, M. Pawan Kumar
AINA
2009
IEEE
16 years 1 months ago
A Topology Control Protocol for 2D Poisson Distributed Wireless Sensor Networks
—Topology control in a wireless sensor network is useful for ensuring that the network remains connected in the presence of nodes that exhaust their energy or become altogether d...
Waltenegus Dargie, Alexander Schill, Rami Mochaour...
MSWIM
2009
ACM
16 years 29 days ago
HUBCODE: message forwarding using hub-based network coding in delay tolerant networks
Most people-centric delay tolerant networks have been shown to exhibit power-law behavior. Analysis of the temporal connectivity graph of such networks reveals the existence of hu...
Shabbir Ahmed, Salil S. Kanhere