Sciweavers

16430 search results - page 14 / 3286
» On Computable Tree Functions
Sort
View
METMBS
2004
140views Mathematics» more  METMBS 2004»
13 years 9 months ago
New Techniques for Generation and Analysis of Evolutionary Trees
We introduce new distance measures for the construction and analysis of phylogenies, focusing on thioredoxin-fold proteins. Our distance measures for tree construction are based o...
Chang Wang, Stephen D. Scott, Qingping Tao, Dmitri...
CCR
2004
113views more  CCR 2004»
13 years 7 months ago
Implementing aggregation and broadcast over Distributed Hash Tables
Peer-to-peer (P2P) networks represent an effective way to share information, since there are no central points of failure or bottleneck. However, the flip side to the distributive...
Ji Li, Karen R. Sollins, Dah-Yoh Lim
CPC
2006
69views more  CPC 2006»
13 years 7 months ago
Size and Weight of Shortest Path Trees with Exponential Link Weights
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete g...
Remco van der Hofstad, Gerard Hooghiemstra, Piet V...
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 1 months ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
LICS
2009
IEEE
14 years 2 months ago
Functional Reachability
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
C.-H. Luke Ong, Nikos Tzevelekos