Sciweavers

1494 search results - page 290 / 299
» Polynomial time algorithms for network information flow
Sort
View
MOBISYS
2010
ACM
13 years 9 months ago
CrowdSearch: exploiting crowds for accurate real-time image search on mobile phones
Mobile phones are becoming increasingly sophisticated with a rich set of on-board sensors and ubiquitous wireless connectivity. However, the ability to fully exploit the sensing c...
Tingxin Yan, Vikas Kumar, Deepak Ganesan
CORR
2006
Springer
117views Education» more  CORR 2006»
13 years 7 months ago
Distributed Transmit Beamforming using Feedback Control
The concept of distributed transmit beamforming is implicit in many key results of network information theory. However, its implementation in a wireless network involves the funda...
Raghuraman Mudumbai, J. Hespanha, Upamanyu Madhow,...
CN
2004
150views more  CN 2004»
13 years 7 months ago
Optimizing interconnection policies
There are two basic types of interconnection agreements between providers in the Internet: peering and transit. A decision every Internet network service provider (INSP) has to ma...
Oliver Heckmann, Jens Schmitt, Ralf Steinmetz
IPPS
2005
IEEE
14 years 1 months ago
On the Optimal Placement of Secure Data Objects over Internet
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
Manghui Tu, Peng Li, Qingkai Ma, I-Ling Yen, Farok...
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 9 days ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...