335 search results - page 56 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
CG
2008
Springer
13 years 7 months ago
2008
Springer
Particle-based simulation methods are used to model a wide range of complex phenomena and to solve time-dependent problems of various scales. Effective visualizations of the resul...
PARELEC
2002
IEEE
14 years 9 days ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
Before the advent of Hidden Markov Models(HMM)-based speech recognition, many speech applications were built using pattern matching algorithms like the Dynamic Time Warping (DTW) ...
TCOM
2008
13 years 7 months ago
2008
Abstract-- Traditionally, conflict resolution in an inputbuffered switch is solved by finding a matching between inputs and outputs per time slot. To do this, a switch not only nee...