7930 search results - page 550 / 1586 » Greedy in Approximation Algorithms |
181
click to vote
UAI
1996
15 years 8 months ago
1996
Two Bayesian-network structures are said to be equivalent if the set of distributions that can be represented with one of those structures is identical to the set of distributions...
189
click to vote
ICML
2010
IEEE
15 years 8 months ago
2010
IEEE
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
196
click to vote
DATAMINE
2006
15 years 7 months ago
2006
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
208
click to vote
HEURISTICS
2006
15 years 7 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
230
click to vote
SENSYS
2010
ACM
15 years 5 months ago
2010
ACM
Geographic routing is of interest for sensor networks because a point-to-point primitive is an important building block for data-centric applications. While there is a significant...