1379 search results - page 159 / 276 » The Complexity of the Annihilating Polynomial |
168
click to vote
SDM
2007
SIAM
15 years 7 months ago
2007
SIAM
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
169
click to vote
AAAI
2006
15 years 7 months ago
2006
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
186
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
Nonlinear approximation has usually been studied under deterministic assumptions and complete information about the underlying functions. In the present paper we assume only partia...
184
click to vote
GLVLSI
2010
IEEE
15 years 6 months ago
2010
IEEE
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...
172
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
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...