Sciweavers

364 search results - page 38 / 73
» Generalized normal forms and polynomial system solving
Sort
View
PAMI
2006
164views more  PAMI 2006»
15 years 5 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero
162
Voted
RTCSA
2006
IEEE
15 years 12 months ago
Characterization and Analysis of Tasks with Offsets: Monotonic Transactions
This article introduces the concept of monotonic transactions. A monotonic transaction is a particular case of transactions for which the load arrival pattern is (or can be by rot...
Karim Traore, Emmanuel Grolleau, Francis Cottet
MFCS
2005
Springer
15 years 11 months ago
Regular Sets of Higher-Order Pushdown Stacks
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
Arnaud Carayol
137
Voted
MP
1998
105views more  MP 1998»
15 years 5 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal
GLVLSI
2008
IEEE
120views VLSI» more  GLVLSI 2008»
16 years 12 days ago
SAT-based equivalence checking of threshold logic designs for nanotechnologies
Novel nano-scale devices have shown promising potential to overcome physical barriers faced by complementary metaloxide semiconductor (CMOS) technology in future circuit design. H...
Yexin Zheng, Michael S. Hsiao, Chao Huang