Sciweavers

4009 search results - page 437 / 802
» Clustering on Complex Graphs
Sort
View
ARC
2008
Springer
128views Hardware» more  ARC 2008»
15 years 8 months ago
A Framework for the Automatic Generation of Instruction-Set Extensions for Reconfigurable Architectures
Abstract. In this paper we present a framework for the automatic identification and selection of convex MIMO instruction-set extensions for reconfigurable architecture. The framewo...
Carlo Galuzzi, Koen Bertels
ICML
2004
IEEE
16 years 7 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
CP
2009
Springer
16 years 7 months ago
Same-Relation Constraints
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
Christopher Jefferson, Karen E. Petrie, Meinolf Se...
BIBM
2009
IEEE
206views Bioinformatics» more  BIBM 2009»
16 years 1 months ago
Application of Kernel Functions for Accurate Similarity Search in Large Chemical Databases
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
Xiaohong Wang, Jun Huan, Aaron M. Smalter, Gerald ...
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 10 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó