Sciweavers

1068 search results - page 62 / 214
» On Space Bounded Server Algorithms
Sort
View
JMLR
2006
105views more  JMLR 2006»
13 years 7 months ago
Some Theory for Generalized Boosting Algorithms
We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. ...
Peter J. Bickel, Yaacov Ritov, Alon Zakai
MP
2006
88views more  MP 2006»
13 years 7 months ago
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCorm...
PPSN
2010
Springer
13 years 6 months ago
Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
The hypervolume indicator is widely used to guide the search and to evaluate the performance of evolutionary multi-objective optimization algorithms. It measures the volume of the ...
Karl Bringmann, Tobias Friedrich
SYNASC
2006
IEEE
121views Algorithms» more  SYNASC 2006»
14 years 1 months ago
Color Texture Modeling and Color Image Decomposition in a Variational-PDE Approach
This paper is devoted to a new variational model for color texture modeling and color image decomposition into cartoon and texture. A given image f in the RGB space is decomposed ...
Luminita A. Vese, Stanley Osher
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
14 years 1 months ago
Heap space analysis for java bytecode
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...