381 search results - page 52 / 77 » Time Complexity of genetic algorithms on exponentially scale... |
STACS
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
CCGRID
2010
IEEE
13 years 8 months ago
2010
IEEE
Abstract--Large high dimension datasets are of growing importance in many fields and it is important to be able to visualize them for understanding the results of data mining appro...
ASIACRYPT
2000
Springer
14 years 1 days ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
FGR
2008
IEEE
14 years 2 months ago
2008
IEEE
Temporal segmentation of human motion into actions is a crucial step for understanding and building computational models of human motion. Several issues contribute to the challeng...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...