398 search results - page 36 / 80 » A new biclustering technique based on crossing minimization |
PAMI
1998
15 years 2 days ago
1998
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
102
Voted
COLT
2000
Springer
15 years 4 months ago
2000
Springer
Boosting algorithms like AdaBoost and Arc-GV are iterative strategies to minimize a constrained objective function, equivalent to Barrier algorithms. Based on this new understandi...
114
click to vote
JMLR
2006
15 years 11 days ago
2006
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...
124
Voted
PROFES
2001
Springer
15 years 4 months ago
2001
Springer
New information is obtained by research and disseminated by papers in conferences and journals. The synthesis of knowledge depends upon social discourse among the experts in a give...
116
Voted
DAC
1989
ACM
15 years 4 months ago
1989
ACM
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...