Sciweavers

2322 search results - page 281 / 465
» On a game in directed graphs
Sort
View
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
16 years 7 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
RECOMB
2008
Springer
16 years 6 months ago
A Phylogenetic Approach to Genetic Map Refinement
Following various genetic mapping techniques conducted on different segregating populations, one or more genetic maps are obtained for a given species. However, recombination analy...
Denis Bertrand, Mathieu Blanchette, Nadia El-Mabro...
WEBI
2009
Springer
16 years 1 months ago
Rigorous Probabilistic Trust-Inference with Applications to Clustering
The World Wide Web has transformed into an environment where users both produce and consume information. In order to judge the validity of information, it is important to know how...
Thomas DuBois, Jennifer Golbeck, Aravind Srinivasa...
CDC
2008
IEEE
162views Control Systems» more  CDC 2008»
16 years 29 days ago
Synchronization in networks of nonlinear oscillators with coupling delays
Abstract— We consider the synchronization problem of an arbitrary number of coupled nonlinear oscillators with delays in the interconnections. The emphasis is on coupled Lorenz s...
Wim Michiels, Henk Nijmeijer
INFOCOM
2008
IEEE
16 years 26 days ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang