Sciweavers

1434 search results - page 220 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
SIGMETRICS
2002
ACM
128views Hardware» more  SIGMETRICS 2002»
13 years 9 months ago
High-density model for server allocation and placement
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
Craig W. Cameron, Steven H. Low, David X. Wei
SIAMCO
2010
147views more  SIAMCO 2010»
13 years 8 months ago
Anytime Reliable Transmission of Real-Valued Information through Digital Noisy Channels
Abstract. The problem of reliably transmitting a real-valued random vector through a digital noisy channel is relevant for the design of distributed estimation and control techniqu...
Giacomo Como, Fabio Fagnani, Sandro Zampieri
CVPR
2008
IEEE
14 years 11 months ago
Estimating age, gender, and identity using first name priors
Recognizing people in images is one of the foremost challenges in computer vision. It is important to remember that consumer photography has a highly social aspect. The photograph...
Andrew C. Gallagher, Tsuhan Chen
MOBIHOC
2005
ACM
14 years 9 months ago
Inducing spatial clustering in MAC contention for spread spectrum ad hoc networks
This paper proposes a new principle for designing MAC protocols for spread spectrum based ad hoc networks ? inducing spatial clustering in contending transmitters/receivers. We fi...
Xiangying Yang, Gustavo de Veciana
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 3 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith