4047 search results - page 251 / 810 » The Discrete Basis Problem |
148
click to vote
IFIP
1994
Springer
15 years 8 months ago
1994
Springer
The computer simulation control problem can be splitted in two parts, namely a local control problem and a global control problem. The local control de nes the \behavior" of ...
117
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
149
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
283
click to vote
ICDE
1999
IEEE
16 years 5 months ago
1999
IEEE
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
129
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Magnetic resonance imaging (MRI) allows numerous Fourier domain sampling schemes such as Cartesian and non-Cartesian trajectories (e.g. Polar, circular, and spherical). On the oth...