Sciweavers

123 search results - page 11 / 25
» Computing upper and lower bounds on likelihoods in intractab...
Sort
View
UAI
2004
13 years 8 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 8 months ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
ALGORITHMICA
2010
154views more  ALGORITHMICA 2010»
13 years 7 months ago
On the Convergence of Multicast Games in Directed Networks
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
Angelo Fanelli, Michele Flammini, Luca Moscardelli
RECOMB
2006
Springer
14 years 7 months ago
Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in
Meiotic recombination is a fundamental biological event and one of the principal evolutionary forces responsible for shaping genetic variation within species. In addition to its fu...
Yun S. Song, Zhihong Ding, Dan Gusfield, Charles H...
WCNC
2010
IEEE
13 years 11 months ago
Adaptive Multiple Relay Selection Scheme for Cooperative Wireless Networks
Abstract—In this paper, we propose an output-threshold multiple relay selection scheme for dual-hop multi-branch cooperative wireless networks. The proposed scheme selects the ï¬...
Gayan Amarasuriya, Masoud Ardakani, Chintha Tellam...