Sciweavers

173 search results - page 32 / 35
» Round Robin Classification
Sort
View
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 9 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
AVI
2010
13 years 8 months ago
Designing a cross-channel information management tool for workers in enterprise task forces
This paper presents a research project on the design of a cross-channel information management tool for knowledge workers: we focus on IT services professionals in a large enterpr...
Gregorio Convertino, Sanjay Kairam, Lichan Hong, B...
PR
2008
85views more  PR 2008»
13 years 8 months ago
Quadratic boosting
This paper presents a strategy to improve the AdaBoost algorithm with a quadratic combination of base classifiers. We observe that learning this combination is necessary to get be...
Thang V. Pham, Arnold W. M. Smeulders
SIAMDM
2008
139views more  SIAMDM 2008»
13 years 8 months ago
Approximate Integer Decompositions for Undirected Network Design Problems
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
Chandra Chekuri, F. Bruce Shepherd
SIAMAM
2002
75views more  SIAMAM 2002»
13 years 7 months ago
Exponential Asymptotics and Capillary Waves
Recently developed techniques in exponential asymptotics beyond all orders are employed on the problem of potential flows with a free surface and small surface tension, in the abse...
Jean-Marc Vanden-Broeck, S. Jonathan Chapman