Sciweavers

1058 search results - page 134 / 212
» It's Doomed; We Can Prove It
Sort
View
ICDCS
2006
IEEE
14 years 4 months ago
Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks
Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of ne...
Haiying Shen, Cheng-Zhong Xu
JACM
2006
99views more  JACM 2006»
13 years 10 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
COCOON
2003
Springer
14 years 3 months ago
On a Conjecture on Wiener Indices in Combinatorial Chemistry
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. ...
COCOON
2009
Springer
14 years 4 months ago
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V, E1) and G2 = (V, E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \ E1 such ...
Pinar Heggernes, Federico Mancini, Charis Papadopo...
KAIS
2006
87views more  KAIS 2006»
13 years 10 months ago
Improving the performance of 1D object classification by using the Electoral College
Abstract It has been proven that districted matching schemes (e.g., the US presidential election scheme, also called the Electoral College) are more stable than undistricted matchi...
Liang Chen, Ruoyu Chen, Sharmin Nilufar