Sciweavers

1379 search results - page 160 / 276
» The Complexity of the Annihilating Polynomial
Sort
View
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
MICS
2010
123views more  MICS 2010»
15 years 4 months ago
On the Topology of Real Algebraic Plane Curves
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
Jinsan Cheng, Sylvain Lazard, Luis Mariano Pe&ntil...
ASPDAC
2010
ACM
211views Hardware» more  ASPDAC 2010»
15 years 4 months ago
A fast analog mismatch analysis by an incremental and stochastic trajectory piecewise linear macromodel
To cope with an increasing complexity when analyzing analog mismatch in sub-90nm designs, this paper presents a fast non-MonteCarlo method to calculate mismatch in time domain. Th...
Hao Yu, Xuexin Liu, Hai Wang, Sheldon X.-D. Tan