Sciweavers

4616 search results - page 272 / 924
» The Communication Complexity of Correlation
Sort
View
JGAA
2002
74views more  JGAA 2002»
15 years 6 months ago
Realization of Posets
We prove a very general representation theorem for posets and, as a corollary, deduce that any abstract simplicial complex has a geometric realization in the Euclidean space of di...
Patrice Ossona de Mendez
INFOCOM
2010
IEEE
15 years 5 months ago
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
Shouwen Lai, Binoy Ravindran
INFOCOM
2006
IEEE
16 years 24 days ago
Self-Learning Collision Avoidance for Wireless Networks
— The limited number of orthogonal channels and the autonomous installations of hotspots and home wireless networks often leave neighboring 802.11 basic service sets (BSS’s) op...
Chun-cheng Chen, Eunsoo Seo, Hwangnam Kim, Haiyun ...
VLSID
2005
IEEE
121views VLSI» more  VLSID 2005»
16 years 7 months ago
A Heuristic for Peak Power Constrained Design of Network-on-Chip (NoC) Based Multimode Systems
Designing NoC-based systems has become increasingly complex with support for multiple functionalities. Decisions regarding interconnections between the heterogeneous system compon...
Praveen Bhojwani, Rabi N. Mahapatra, Eun Jung Kim,...
ISAAC
2009
Springer
98views Algorithms» more  ISAAC 2009»
16 years 1 months ago
On the Tightness of the Buhrman-Cleve-Wigderson Simulation
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...
Shengyu Zhang