Sciweavers

1261 search results - page 242 / 253
» Approximation algorithms for aligning points
Sort
View
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 7 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
MOBIHOC
2008
ACM
14 years 7 months ago
Strong barrier coverage of wireless sensor networks
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipu...
MOBICOM
2004
ACM
14 years 27 days ago
Fairness and load balancing in wireless LANs using association control
—The traffic load of wireless LANs is often unevenly distributed among the access points (APs), which results in unfair bandwidth allocation among users. We argue that the load ...
Yigal Bejerano, Seung-Jae Han, Erran L. Li
INFOCOM
1998
IEEE
13 years 11 months ago
Implementing Distributed Packet Fair Queueing in a Scalable Switch Architecture
To support the Internet's explosive growth and expansion into a true integrated services network, there is a need for cost-effective switching technologies that can simultaneo...
Donpaul C. Stephens, Hui Zhang
FAST
2004
13 years 8 months ago
CAR: Clock with Adaptive Replacement
CLOCK is a classical cache replacement policy dating back to 1968 that was proposed as a low-complexity approximation to LRU. On every cache hit, the policy LRU needs to move the a...
Sorav Bansal, Dharmendra S. Modha