Sciweavers

7015 search results - page 302 / 1403
» Approximation algorithms for co-clustering
Sort
View
JAIR
2010
130views more  JAIR 2010»
15 years 5 months ago
Join-Graph Propagation Algorithms
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina D...
ICDCIT
2012
Springer
14 years 2 months ago
Decision Making as Optimization in Multi-robot Teams
Abstract. A key challenge in multi-robot teaming research is determining how to properly enable robots to make decisions on actions they should take to contribute to the overall sy...
Lynne E. Parker
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
13 years 9 months ago
Optimal crowdsourcing contests
We study the design and approximation of optimal crowdsourcing contests. Crowdsourcing contests can be modeled as all-pay auctions because entrants must exert effort up-front to e...
Shuchi Chawla, Jason D. Hartline, Balasubramanian ...
ICPR
2002
IEEE
16 years 7 months ago
A Fast Leading Eigenvector Approximation for Segmentation and Grouping
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
Antonio Robles-Kelly, Sudeep Sarkar, Edwin R. Hanc...
ISAAC
2005
Springer
81views Algorithms» more  ISAAC 2005»
16 years 5 days ago
Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem
We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the Mendelian Law of Inheritance and the minimum recombinant...
Lan Liu, Xi Chen, Jing Xiao, Tao Jiang