Sciweavers

9949 search results - page 1690 / 1990
» On the Network Complexity of Selection
Sort
View
TSP
2008
100views more  TSP 2008»
15 years 6 months ago
Time-Slotted Round-Trip Carrier Synchronization for Distributed Beamforming
Transmit beamforming is an energy-efficient wireless communication technique that allows a transmitter with two or more antennas to focus its bandpass signal in an intended directi...
D. Richard Brown III, H. Vincent Poor
CN
2002
124views more  CN 2002»
15 years 6 months ago
An efficient traffic control scheme for TCP over ATM GFR services
In ATM networks, the guaranteed frame rate (GFR) service category has been defined to support user applications which are neither able to specify the range of traffic parameter va...
Chia-Tai Chan, Pi-Chung Wang, Yaw-Chung Chen
COMCOM
2002
86views more  COMCOM 2002»
15 years 6 months ago
The potential costs and benefits of long-term prefetching for content distribution
This paper examines the costs and potential benefits of long-term prefetching for content distribution. In traditional short-term prefetching, caches use recent access history to ...
Arun Venkataramani, Praveen Yalagandula, Ravi Kokk...
CSCW
2002
ACM
15 years 6 months ago
On the recommending of citations for research papers
Collaborative filtering has proven to be valuable for recommending items in many different domains. In this paper, we explore the use of collaborative filtering to recommend resea...
Sean M. McNee, Istvan Albert, Dan Cosley, Prateep ...
ALGORITHMICA
1998
94views more  ALGORITHMICA 1998»
15 years 6 months ago
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
Philip N. Klein, Sairam Subramanian
« Prev « First page 1690 / 1990 Last » Next »