Sciweavers

104 search results - page 6 / 21
» Efficient Algorithms for k Maximum Sums
Sort
View
TSMC
2008
136views more  TSMC 2008»
13 years 7 months ago
On 3-D Point Set Matching With MAE and SAE Cost Criteria
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
Giuseppe C. Calafiore
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
13 years 7 months ago
Geographic Quorum System Approximations
Quorum systems are a mechanism for obtaining fault-tolerance and efficient distributed systems. We consider geographic quorum systems; a geographic quorum system is a partition of...
Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew...
TIT
2010
170views Education» more  TIT 2010»
13 years 2 months ago
Belief propagation estimation of protein and domain interactions using the sum-product algorithm
We present a novel framework to estimate protein-protein (PPI) and domain-domain (DDI) interactions based on a belief propagation estimation method that efficiently computes inter...
Faruck Morcos, Marcin Sikora, Mark S. Alber, Dale ...
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 7 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010
ICDCS
1996
IEEE
13 years 11 months ago
How to Recover Efficiently and Asynchronously when Optimism Fails
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock t...
Om P. Damani, Vijay K. Garg