Sciweavers

903 search results - page 64 / 181
» Non-well-founded trees in categories
Sort
View
SIGIR
2005
ACM
15 years 11 months ago
Boosted decision trees for word recognition in handwritten document retrieval
Recognition and retrieval of historical handwritten material is an unsolved problem. We propose a novel approach to recognizing and retrieving handwritten manuscripts, based upon ...
Nicholas R. Howe, Toni M. Rath, R. Manmatha
PODC
2004
ACM
15 years 11 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
INFOVIS
2003
IEEE
15 years 11 months ago
Visualizing Evolving Networks: Minimum Spanning Trees versus Pathfinder Networks
Network evolution is a ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such...
Chaomei Chen, Steven Morris
ICS
2009
Tsinghua U.
15 years 10 months ago
Exploring pattern-aware routing in generalized fat tree networks
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
Germán Rodríguez, Ramón Beivi...
ICFP
2008
ACM
16 years 6 months ago
Efficient nondestructive equality checking for trees and graphs
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
Michael D. Adams, R. Kent Dybvig