Sciweavers

251 search results - page 40 / 51
» Constructive Linear Time Algorithms for Branchwidth
Sort
View
PR
2008
85views more  PR 2008»
14 years 9 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
COMGEO
2004
ACM
14 years 9 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
PODS
2007
ACM
171views Database» more  PODS 2007»
15 years 9 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
RECOMB
2006
Springer
15 years 9 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
77
Voted
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
15 years 2 months ago
Matching Polyhedral Terrains Using Overlays of Envelopes
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
Vladlen Koltun, Carola Wenk