1486 search results - page 109 / 298 » Algorithms for two-box covering |
138
click to vote
ECCC
2006
15 years 4 months ago
2006
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
140
Voted
STOC
2004
ACM
16 years 4 months ago
2004
ACM
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
122
click to vote
APLAS
2009
ACM
15 years 10 months ago
2009
ACM
We present a simple algorithmic extension of the classical call-strings approach to mitigate substantial performance degradation caused by spurious interprocedural cycles. Spuriou...
132
click to vote
CIARP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper we introduce a general framework for hierarchical clustering that deals with both static and dynamic data sets. From this framework, different hierarchical...
123
Voted
PARELEC
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...