3466 search results - page 68 / 694 » Fast computation of special resultants |
100
Voted
APNOMS
2006
Springer
15 years 4 months ago
2006
Springer
This paper shows that geographic information system can successfully solve TSP (travelling salesman problem). It has been done using a module of the designed and implemented by aut...
108
Voted
FCT
1995
Springer
15 years 4 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
DMIN
2007
15 years 2 months ago
2007
K-Nearest Neighbor is used broadly in text classification, but it has one deficiency—computational efficiency. In this paper, we propose a heuristic search way to find out the k ...
CORR
2007
Springer
15 years 19 days ago
2007
Springer
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by sever...
103
Voted
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
We propose a variational multigrid method for fast 3D interpretation of image sequences, in which a dense depth map and 3D motion are directly recovered from spatiotemporal change...