Sciweavers

5595 search results - page 1070 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
WWW
2005
ACM
16 years 3 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
141
Voted
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 3 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
119
Voted
PG
2007
IEEE
15 years 9 months ago
Visualisation of Implicit Algebraic Curves
We describe a new algorithm for the visualisation of implicit algebraic curves, which isolates the singular points, compute the topological degree around these points in order to ...
Lionel Alberti, Bernard Mourrain
156
Voted
EUROGP
2005
Springer
115views Optimization» more  EUROGP 2005»
15 years 8 months ago
Genetic Programming in Wireless Sensor Networks
Abstract. Wireless sensor networks (WSNs) are medium scale manifestations of a paintable or amorphous computing paradigm. WSNs are becoming increasingly important as they attain gr...
Derek M. Johnson, Ankur Teredesai, Robert T. Salta...
112
Voted
MOBICOM
2004
ACM
15 years 8 months 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
« Prev « First page 1070 / 1119 Last » Next »