817 search results - page 124 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
STOC
2002
ACM
14 years 8 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
EDUTAINMENT
2007
Springer
14 years 1 months ago
2007
Springer
As many 3D on-line games appear, there is an increased need for simple and efficient techniques to create many new faces. This paper presents a new algorithm to composite 3D faces ...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Given multiple time sequences with missing values, we propose DynaMMo which summarizes, compresses, and finds latent variables. The idea is to discover hidden variables and learn ...
GD
2004
Springer
14 years 1 months ago
2004
Springer
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
SIAMCOMP
2002
13 years 7 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...