2412 search results - page 265 / 483 » Which Problems Have Strongly Exponential Complexity |
146
Voted
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
135
Voted
ISCI
2008
15 years 3 months ago
2008
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...
132
Voted
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
145
Voted
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
Temporal causal modeling can be used to recover the causal structure among a group of relevant time series variables. Several methods have been developed to explicitly construct te...
154
Voted
ESORICS
2011
Springer
14 years 3 months ago
2011
Springer
The rapid progress of human genome studies leads to a strong demand of aggregate human DNA data (e.g, allele frequencies, test statistics, etc.), whose public dissemination, howeve...