Sciweavers

2996 search results - page 193 / 600
» Numberings and Randomness
Sort
View
WABI
2001
Springer
15 years 11 months ago
The Performance of Phylogenetic Methods on Trees of Bounded Diameter
We study the convergence rates of neighbor-joining and several new phylogenetic reconstruction methods on families of trees of bounded diameter. Our study presents theoretically ob...
Luay Nakhleh, Usman Roshan, Katherine St. John, Je...
AAAI
2004
15 years 8 months ago
Affective Recruitment of Distributed Heterogeneous Agents
Members of multi-robot teams may need to collaborate to accomplish a task due to differences in capabilities. This paper describes an extension of the ALLIANCE architecture that e...
Aaron Gage, Robin R. Murphy
STOC
1996
ACM
101views Algorithms» more  STOC 1996»
15 years 10 months ago
The Space Complexity of Approximating the Frequency Moments
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
Noga Alon, Yossi Matias, Mario Szegedy
FOCS
2008
IEEE
16 years 1 months ago
On the Value of Multiple Read/Write Streams for Approximating Frequency Moments
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...
Paul Beame, Dang-Trinh Huynh-Ngoc
PDCAT
2005
Springer
16 years 1 days ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu