Sciweavers

866 search results - page 19 / 174
» Networked Slepian-Wolf: Theory and Algorithms
Sort
View
INFOCOM
2009
IEEE
16 years 24 days ago
A Theory of QoS for Wireless
—Wireless networks are increasingly used to carry applications with QoS constraints. Two problems arise when dealing with traffic with QoS constraints. One is admission control,...
I-Hong Hou, Vivek Borkar, P. R. Kumar
IJCV
2007
159views more  IJCV 2007»
15 years 6 months ago
Face Hallucination: Theory and Practice
In this paper, we study face hallucination, or synthesizing a high-resolution face image from an input low-resolution image, with the help of a large collection of other high-reso...
Ce Liu, Heung-Yeung Shum, William T. Freeman
IPL
2010
109views more  IPL 2010»
15 years 29 days ago
A new parameter for a broadcast algorithm with locally bounded Byzantine faults
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...
Akira Ichimura, Maiko Shigeno
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
15 years 3 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
MOBIHOC
2004
ACM
16 years 5 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...