Sciweavers

474 search results - page 39 / 95
» On Multicast Path Finding Algorithms
Sort
View
DICTA
2003
13 years 9 months ago
Gesture Classification Using Hidden Markov Models and Viterbi Path Counting
Human-Machine interfaces play a role of growing importance as computer technology continues to evolve. Motivated by the desire to provide users with an intuitive gesture input syst...
Nianjun Liu, Brian C. Lovell
EURODAC
1994
IEEE
141views VHDL» more  EURODAC 1994»
13 years 12 months ago
Exact path sensitization in timing analysis
of a direct implementation of this criterion. This paper presents the first critical path finding tool based on the exact criterion. It offers therefore better results in compariso...
R. Peset Llopis
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 6 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
ALENEX
2010
161views Algorithms» more  ALENEX 2010»
13 years 9 months ago
Route Planning with Flexible Objective Functions
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
Robert Geisberger, Moritz Kobitzsch, Peter Sanders
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
13 years 11 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev