Sciweavers

2069 search results - page 375 / 414
» Linear time algorithms for Clobber
Sort
View
JSAT
2006
88views more  JSAT 2006»
15 years 5 months ago
On Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
Vasco M. Manquinho, João P. Marques Silva
PR
2008
85views more  PR 2008»
15 years 5 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
151
Voted
PR
2006
122views more  PR 2006»
15 years 5 months ago
Fast multiscale clustering and manifold identification
We present a novel multiscale clustering algorithm inspired by algebraic multigrid techniques. Our method begins with assembling data points according to local similarities. It us...
Dan Kushnir, Meirav Galun, Achi Brandt
149
Voted
COMGEO
2004
ACM
15 years 5 months ago
Proximity drawings in polynomial area and volume
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
Paolo Penna, Paola Vocca
ADCM
1998
132views more  ADCM 1998»
15 years 5 months ago
Numerical solution of generalized Lyapunov equations
Two e cient methods for solving generalized Lyapunov equations and their implementations in FORTRAN 77 are presented. The rst one is a generalization of the Bartels{Stewart method...
Thilo Penzl