Sciweavers

1369 search results - page 252 / 274
» Lattice computations for random numbers
Sort
View
TSP
2010
13 years 3 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
CORR
2011
Springer
196views Education» more  CORR 2011»
13 years 18 days ago
Privacy-Enhanced Reputation-Feedback Methods to Reduce Feedback Extortion in Online Auctions
In this paper, we study methods for improving the utility and privacy of reputation scores for online auctions, such as used in eBay, so as to reduce the effectiveness of feedbac...
Michael T. Goodrich, Florian Kerschbaum
RECOMB
2012
Springer
11 years 11 months ago
Recovering the Tree-Like Trend of Evolution Despite Extensive Lateral Genetic Transfer: A Probabilistic Analysis
Abstract. Lateral gene transfer (LGT) is a common mechanism of nonvertical evolution where genetic material is transferred between two more or less distantly related organisms. It ...
Sebastien Roch, Sagi Snir
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
13 years 8 months ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Hsien-Kuei Hwang, Ralph Neininger
CVPR
2009
IEEE
15 years 3 months ago
Dictionary-Free Categorization of Very Similar Objects via Stacked Evidence Trees
Current work in object categorization discriminates among objects that typically possess gross differences which are readily apparent. However, many applications require making ...
Andrew Moldenke, Asako Yamamuro, David A. Lytle, E...