Sciweavers

1728 search results - page 155 / 346
» The Accelerated Euclidean Algorithm
Sort
View
STACS
2007
Springer
15 years 9 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
SPAA
2003
ACM
15 years 8 months ago
On local algorithms for topology control and routing in ad hoc networks
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any fixed infrastructure. Indeed, an important task of an ad hoc network...
Lujun Jia, Rajmohan Rajaraman, Christian Scheidele...
ML
2010
ACM
142views Machine Learning» more  ML 2010»
15 years 1 months ago
Fast adaptive algorithms for abrupt change detection
We propose two fast algorithms for abrupt change detection in streaming data that can operate on arbitrary unknown data distributions before and after the change. The first algor...
Daniel Nikovski, Ankur Jain
GECCO
2003
Springer
137views Optimization» more  GECCO 2003»
15 years 8 months ago
The Spatially-Dispersed Genetic Algorithm
Abstract. Spatially structured population models improve the performance of genetic algorithms by assisting the selection scheme in maintaining diversity. A significant concern wi...
Grant Dick
COLT
2006
Springer
15 years 7 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal