Sciweavers

347 search results - page 59 / 70
» The Berlekamp-Massey Algorithm revisited
Sort
View
SIGCOMM
2010
ACM
14 years 11 months ago
Improving peer-to-peer file distribution: winner doesn't have to take all
Recent work on BitTorrent has shown that the choke/unchoke mechanism implements an auction where each peer tries to induce other peers into "unchoking" it by uploading m...
Ben Leong, Youming Wang, Su Wen, Cristina Carbunar...
79
Voted
ALGORITHMICA
2010
156views more  ALGORITHMICA 2010»
14 years 11 months ago
On Covering Problems of Rado
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
Sergey Bereg, Adrian Dumitrescu, Minghui Jiang
EOR
2010
125views more  EOR 2010»
14 years 11 months ago
Efficient estimation of large portfolio loss probabilities in t-copula models
We consider the problem of accurately measuring the credit risk of a portfolio consisting of loans, bonds and other financial assets. One particular performance measure of interes...
Joshua C. C. Chan, Dirk P. Kroese
COMPGEOM
2010
ACM
15 years 3 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
KDD
2006
ACM
112views Data Mining» more  KDD 2006»
15 years 11 months ago
K-means clustering versus validation measures: a data distribution perspective
K-means is a widely used partitional clustering method. While there are considerable research efforts to characterize the key features of K-means clustering, further investigation...
Hui Xiong, Junjie Wu, Jian Chen