Sciweavers

1327 search results - page 177 / 266
» Path following algorithm for the graph matching problem
Sort
View
ACMSE
2009
ACM
15 years 8 months ago
FI-based file access predictor
An algorithm is proposed for the purpose of optimizing the availability of files to an operating system prior to their being required during execution by a running system. This al...
Jinsuk Baek, Paul S. Fisher, Mingyung Kwak
SAC
2008
ACM
15 years 1 months ago
PHALANX: a graph-theoretic framework for test case prioritization
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...
Murali Krishna Ramanathan, Mehmet Koyutürk, A...
136
Voted
JSAC
2006
115views more  JSAC 2006»
15 years 1 months ago
Deployment of an Algorithm for Large-Scale Topology Discovery
Abstract-- Topology discovery systems are starting to be introduced in the form of easily and widely deployed software. Unfortunately, the research community has not examined the p...
Benoit Donnet, Philippe Raoult, Timur Friedman, Ma...
94
Voted
ICPR
2008
IEEE
16 years 3 months ago
On efficient Viterbi decoding for hidden semi-Markov models
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
Bonnie K. Ray, Jianying Hu, Ritendra Datta
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 6 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis