Sciweavers

3136 search results - page 341 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
ALT
2001
Springer
16 years 3 months ago
Learning of Boolean Functions Using Support Vector Machines
This paper concerns the design of a Support Vector Machine (SVM) appropriate for the learning of Boolean functions. This is motivated by the need of a more sophisticated algorithm ...
Ken Sadohara
ICCAD
2005
IEEE
105views Hardware» more  ICCAD 2005»
16 years 3 months ago
Response shaper: a novel technique to enhance unknown tolerance for output response compaction
The presence of unknown values in the simulation result is a key barrier to effective output response compaction in practice. This paper proposes a simple circuit module, called a...
Mango Chia-Tso Chao, Seongmoon Wang, Srimat T. Cha...
CVPR
2010
IEEE
16 years 3 months ago
A Game-Theoretic Approach to Fine Surface Registration without Initial Motion Estimation
Surface registration is a fundamental step in the reconstruction of three-dimensional objects. This is typically a two step process where an initial coarse motion estimation is fo...
Andrea Albarelli, Andrea Torsello, Emanuele Rodol
CVPR
2010
IEEE
16 years 2 months ago
An automatic unsupervised classification of MR images in Alzheimer's disease
Image-analysis methods play an important role in helping detect brain changes in and diagnosis of Alzheimer's Disease (AD). In this paper, we propose an automatic unsupervised...
Xiaojing Long
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
16 years 1 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers