4843 search results - page 456 / 969 » The Shortcut Problem - Complexity and Approximation |
157
click to vote
IR
2010
15 years 3 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...
125
click to vote
JCT
2010
15 years 3 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 ≤ · · · â...
239
click to vote
CORR
2010
Springer
15 years 2 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...
148
click to vote
IMCSIT
2010
15 years 2 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...
161
click to vote
ALGORITHMICA
2011
15 years 4 days ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...