9849 search results - page 271 / 1970 » Algorithms and Experiments for the Webgraph |
245
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
221
click to vote
KES
2005
Springer
16 years 22 days ago
2005
Springer
A Decentralised Adaptive Clustering (DAC) algorithm for self-monitoring impact sensing networks is presented within the context of CSIRO-NASA Ageless Aerospace Vehicle project. DAC...
204
click to vote
ICAISC
2010
Springer
15 years 9 months ago
2010
Springer
The problem of finding optimal locations of base stations, their pilot powers and channel assignments in UMTS mobile networks belongs to a class of NP-hard problems, and hence, me...
154
Voted
ICONIP
2004
15 years 8 months ago
2004
Boosting algorithm is understood as the gradient descent algorithm of a loss function. It is often pointed out that the typical boosting algorithm, Adaboost, is seriously affected ...
165
click to vote
SIAMJO
2010
15 years 2 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...