1092 search results - page 87 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
161
click to vote
ACTA
1998
15 years 5 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
182
Voted
ESANN
2007
15 years 7 months ago
2007
Any order parameter quantifying the degree of organisation in a physical system can be studied in connection to source extraction algorithms. Independent component analysis (ICA) b...
172
Voted
COMPLEX
2009
Springer
16 years 17 days ago
2009
Springer
We introduce transformations from time series data to the domain of complex networks which allow us to characterise the dynamics underlying the time series in terms of topological ...
160
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
159
click to vote
STACS
2010
Springer
16 years 29 days ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...