5153 search results - page 336 / 1031 » Introduction to Randomized Algorithms |
137
click to vote
NIPS
2007
15 years 5 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
126
click to vote
ALENEX
2001
15 years 5 months ago
2001
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
145
click to vote
UAI
2004
15 years 5 months ago
2004
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 ...
151
click to vote
JPDC
2007
15 years 4 months ago
2007
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...
ICIP
1998
IEEE
16 years 6 months ago
1998
IEEE
We present a framework for designing fast and monotonic algorithms for transmission tomography penalizedlikelihood image reconstruction. The new algorithms are based on paraboloid...