Sciweavers

7006 search results - page 423 / 1402
» Approximation Algorithms
Sort
View
MOC
1998
106views more  MOC 1998»
15 years 4 months ago
Computations of class numbers of real quadratic fields
In this paper an unconditional probabilistic algorithm to compute the class number of a real quadratic field Q( √ d) is presented, which computes the class number in expected ti...
Anitha Srinivasan
ICWS
2009
IEEE
16 years 2 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
DAM
2010
112views more  DAM 2010»
15 years 5 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
ICONIP
2007
15 years 6 months ago
Natural Conjugate Gradient in Variational Inference
Variational methods for approximate inference in machine learning often adapt a parametric probability distribution to optimize a given objective function. This view is especially ...
Antti Honkela, Matti Tornio, Tapani Raiko, Juha Ka...
FOCS
2007
IEEE
15 years 11 months ago
Buy-at-Bulk Network Design with Protection
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...
Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce...