2252 search results - page 259 / 451 » Lower Bounds for Dynamic Algorithms |
149
Voted
CLUSTER
2001
IEEE
15 years 7 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
126
Voted
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
It was shown recently [7?9], under quite general conditions, that retransmission-based protocols may result in power-law delays and possibly zero throughput even if the distributi...
164
Voted
NEUROSCIENCE
2001
Springer
15 years 8 months ago
2001
Springer
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
123
Voted
ICIP
1994
IEEE
16 years 5 months ago
1994
IEEE
It has been shown that the computation time of Document Image Decoding can be significantly reduced by employing heuristics in the search for the best decoding of a text line. In ...
120
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
—This paper presents a new receiver-initiated sensor network MAC protocol, called CyMAC, which has the following unique features. It reduces the idle listening time of sensor nod...