Sciweavers

2796 search results - page 227 / 560
» The coolest path problem
Sort
View
BMCBI
2010
123views more  BMCBI 2010»
15 years 6 months ago
Decoding HMMs using the k best paths: algorithms and applications
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...
Daniel G. Brown 0001, Daniil Golod
JNW
2008
115views more  JNW 2008»
15 years 6 months ago
On the Interaction Between Multiple Paths and Wireless Mesh Networks Scheduler Approaches
Multi-path routing allows building and use of multiple paths for routing between a source-destination pair. This paper investigates the problem of selecting multiple routing paths ...
Valeria Loscrì
DCG
2010
289views more  DCG 2010»
15 years 6 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...
USENIX
2004
15 years 8 months ago
Trusted Path Execution for the Linux 2.6 Kernel as a Linux Security Module
The prevention of damage caused to a system via malicious executables is a significant issue in the current state of security on Linux operating systems. Several approaches are av...
Niki A. Rahimi
SIAMDM
2010
113views more  SIAMDM 2010»
15 years 1 months ago
The VPN Problem with Concave Costs
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanit&agra...