Sciweavers

7129 search results - page 463 / 1426
» Approximation Algorithms for Treewidth
Sort
View
DAM
2010
112views more  DAM 2010»
15 years 6 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
16 years 7 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
13 years 9 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
CIMCA
2005
IEEE
16 years 2 days ago
Statistical Learning Procedure in Loopy Belief Propagation for Probabilistic Image Processing
We give a fast and practical algorithm for statistical learning hyperparameters from observable data in probabilistic image processing, which is based on Gaussian graphical model ...
Kazuyuki Tanaka
ICWS
2009
IEEE
16 years 3 months ago
What are the Problem Makers: Ranking Activities According to their Relevance for Process Changes
Recently, a new generation of adaptive process management technology has emerged, which enables dynamic changes of composite services and process models respectively. This, in tur...
Chen Li, Manfred Reichert, Andreas Wombacher