Sciweavers

88 search results - page 7 / 18
» Resource Bounded Measure and Learnability
Sort
View
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
14 years 1 months ago
The round complexity of two-party random selection
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
Saurabh Sanghvi, Salil P. Vadhan
SUTC
2010
IEEE
13 years 11 months ago
A Log-Ratio Information Measure for Stochastic Sensor Management
—In distributed sensor networks, computational and energy resources are in general limited. Therefore, an intelligent selection of sensors for measurements is of great importance...
Daniel Lyons, Benjamin Noack, Uwe D. Hanebeck
DASFAA
2006
IEEE
121views Database» more  DASFAA 2006»
14 years 1 months ago
Distributed Network Querying with Bounded Approximate Caching
Abstract. As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build...
Badrish Chandramouli, Jun Yang 0001, Amin Vahdat
SLIP
2003
ACM
14 years 27 days ago
Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
Navaratnasothie Selvakkumaran, Phiroze N. Parakh, ...
ICDCS
2009
IEEE
14 years 2 months ago
Towards Optimal Resource Utilization in Heterogeneous P2P Streaming
Though plenty of research has been conducted to improve Internet P2P streaming quality perceived by endusers, little has been known about the upper bounds of achievable performanc...
Dongyu Liu, Fei Li, Songqing Chen