Sciweavers

74 search results - page 8 / 15
» Algorithms for Generating Convex Sets in Acyclic Digraphs
Sort
View
90
Voted
MP
2006
142views more  MP 2006»
15 years 9 days ago
Exploring the Relationship Between Max-Cut and Stable Set Relaxations
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
Monia Giandomenico, Adam N. Letchford
87
Voted
ICML
2009
IEEE
16 years 1 months ago
Learning kernels from indefinite similarities
Similarity measures in many real applications generate indefinite similarity matrices. In this paper, we consider the problem of classification based on such indefinite similariti...
Yihua Chen, Maya R. Gupta, Benjamin Recht
105
Voted
IPPS
2002
IEEE
15 years 5 months ago
Parallel Out-of-Core Algorithm for Genome-Scale Enumeration of Metabolic Systemic Pathways
Systemic pathways-oriented approaches to analysis of metabolic networks are effective for small networks but are computationally infeasible for genome scale networks. Current comp...
Nagiza F. Samatova, Al Geist, George Ostrouchov, A...
96
Voted
ISCIS
2005
Springer
15 years 5 months ago
Generalizing Redundancy Elimination in Checking Sequences
Abstract. Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set Eα of α –sequences and ...
K. Tuncay Tekle, Hasan Ural, M. Cihan Yalcin, H&uu...
93
Voted
DAC
2004
ACM
16 years 1 months ago
Multiple constant multiplication by time-multiplexed mapping of addition chains
An important primitive in the hardware implementations of linear DSP transforms is a circuit that can multiply an input value by one of several different preset constants. We prop...
James C. Hoe, Markus Püschel, Peter Tummeltsh...