Sciweavers

855 search results - page 17 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
AB
2007
Springer
15 years 1 months ago
Reduction of Algebraic Parametric Systems by Rectification of Their Affine Expanded Lie Symmetries
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equations. ...
Alexandre Sedoglavic
90
Voted
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
15 years 3 months ago
Evolutionary selection of minimum number of features for classification of gene expression data using genetic algorithms
Selecting the most relevant factors from genetic profiles that can optimally characterize cellular states is of crucial importance in identifying complex disease genes and biomark...
Alper Küçükural, Reyyan Yeniterzi...
CCA
2005
Springer
14 years 11 months ago
Computable Versions of Basic Theorems in Functional Analysis
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
Atsushi Yoshikawa, Mariko Yasugi
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 2 days ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen
CNSR
2007
IEEE
101views Communications» more  CNSR 2007»
15 years 4 months ago
The Theory of Natural Movement and its Application to the Simulation of Mobile Ad Hoc Networks (MANET)
The theory of natural movement is fundamental to space syntax: a set of theories and methods developed in the late 1970s that seeks, at a general level, to reveal the mutual effec...
Nick Sheep Dalton, Ruth Conroy Dalton