Sciweavers

1383 search results - page 162 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
GLVLSI
2010
IEEE
168views VLSI» more  GLVLSI 2010»
15 years 6 months ago
A revisit to voltage partitioning problem
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
Tao Lin, Sheqin Dong, Bei Yu, Song Chen, Satoshi G...
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
15 years 6 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
JMLR
2006
124views more  JMLR 2006»
15 years 6 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
ENVSOFT
2007
78views more  ENVSOFT 2007»
15 years 6 months ago
A multi-model approach to analysis of environmental phenomena
Abstract: This paper introduces a novel data-driven methodology named Evolutionary Polynomial Regression (EPR), which permits the multi-purpose modelling of physical phenomena, thr...
Orazio Giustolisi, Angelo Doglioni, D. A. Savic, B...
JCT
2007
133views more  JCT 2007»
15 years 6 months ago
Biased graphs. VII. Contrabalance and antivoltages
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...
Thomas Zaslavsky