Sciweavers

948 search results - page 78 / 190
» What can we achieve by arbitrary announcements
Sort
View
LATIN
2010
Springer
14 years 25 days ago
The Power of Fair Pricing Mechanisms
We explore the revenue capabilities of truthful, monotone (“fair”) allocation and pricing functions for resource-constrained auction mechanisms within a general framework that ...
Christine Chung, Katrina Ligett, Kirk Pruhs, Aaron...
PAMI
2007
138views more  PAMI 2007»
13 years 7 months ago
A Fast Biologically Inspired Algorithm for Recurrent Motion Estimation
—We have previously developed a neurodynamical model of motion segregation in cortical visual area V1 and MT of the dorsal stream. The model explains how motion ambiguities cause...
Pierre Bayerl, Heiko Neumann
TIT
2010
129views Education» more  TIT 2010»
13 years 2 months ago
Random access in wireless networks with overlapping cells
We study cellular-like wireless networks in which the cells may overlap substantially, and a common channel is used for all cells. Thus, transmissions intended for one destination ...
Gam D. Nguyen, Jeffrey E. Wieselthier, Anthony Eph...
INFOCOM
2008
IEEE
14 years 2 months ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel
SRDS
2000
IEEE
14 years 3 days ago
Deterministic Scheduling for Transactional Multithreaded Replicas
One way to implement a fault-tolerant a service is by replicating it at sites that fail independently. One of the replication techniques is active replication where each request i...
Ricardo Jiménez-Peris, Marta Patiño-...