Sciweavers

1529 search results - page 162 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
PR
2006
65views more  PR 2006»
15 years 4 months ago
Why direct LDA is not equivalent to LDA
In this paper, we present counterarguments against the direct LDA algorithm (D-LDA), which was previously claimed to be equivalent to Linear Discriminant Analysis (LDA). We show f...
Hui Gao, James W. Davis
NIPS
1996
15 years 5 months ago
Combinations of Weak Classifiers
To obtain classification systems with both good generalizat`ion performance and efficiency in space and time, we propose a learning method based on combinations of weak classifiers...
Chuanyi Ji, Sheng Ma
SCIA
2009
Springer
161views Image Analysis» more  SCIA 2009»
15 years 11 months ago
A Fast Optimization Method for Level Set Segmentation
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
Thord Andersson, Gunnar Läthén, Reiner...
SOFSEM
2010
Springer
16 years 1 months ago
Improved Matrix Interpretation
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...
Pierre Courtieu, Gladys Gbedo, Olivier Pons
DAC
1999
ACM
15 years 8 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther