4894 search results - page 467 / 979 » The Guarding Problem - Complexity and Approximation |
161
click to vote
NECO
1998
15 years 5 months ago
1998
We derive solutions for the problem of missing and noisy data in nonlinear timeseries prediction from a probabilistic point of view. We discuss different approximations to the so...
171
click to vote
IR
2010
15 years 4 months ago
2010
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
147
Voted
JCT
2010
15 years 4 months ago
2010
We show that for each η > 0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d+ 1 ≤ · · · ≤ d+ n and d− 1 ≤ · · · â...
251
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...
160
Voted
IMCSIT
2010
15 years 3 months ago
2010
Modeling of optimized motion controller is one of the interesting problems in the context of behavior based mobile robotics. Behavior based mobile robots should have an ideal contr...