Sciweavers

1301 search results - page 222 / 261
» Bounded Version Vectors
Sort
View
144
Voted
CVPR
2011
IEEE
14 years 7 months ago
Entropy Rate Superpixel Segmentation
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...
INFOCOM
2011
IEEE
14 years 7 months ago
Approximation algorithms for throughput maximization in wireless networks with delay constraints
—We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention start...
Guanhong Pei, V. S. Anil Kumar, Srinivasan Parthas...
117
Voted
CCS
2009
ACM
15 years 10 months ago
A practical property-based bootstrap architecture
Binary attestation, as proposed by the Trusted Computing Group (TCG), is a pragmatic approach for software integrity protection and verification. However, it has also various sho...
René Korthaus, Ahmad-Reza Sadeghi, Christia...
COCO
2007
Springer
108views Algorithms» more  COCO 2007»
15 years 9 months ago
The Communication Complexity of Correlation
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
Prahladh Harsha, Rahul Jain, David A. McAllester, ...
SIGECOM
2005
ACM
117views ECommerce» more  SIGECOM 2005»
15 years 9 months ago
First-price path auctions
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
Nicole Immorlica, David R. Karger, Evdokia Nikolov...