Sciweavers

903 search results - page 176 / 181
» Non-well-founded trees in categories
Sort
View
SPAA
2005
ACM
15 years 5 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
CIKM
2005
Springer
15 years 5 months ago
Learning to summarise XML documents using content and structure
Documents formatted in eXtensible Markup Language (XML) are becoming increasingly available in collections of various document types. In this paper, we present an approach for the...
Massih-Reza Amini, Anastasios Tombros, Nicolas Usu...
CIKM
2005
Springer
15 years 5 months ago
Semantic similarity over the gene ontology: family correlation and selecting disjunctive ancestors
Many bioinformatics applications would benefit from comparing proteins based on their biological role rather than their sequence. In most biological databases, proteins are alrea...
Francisco M. Couto, Mário J. Silva, Pedro C...
CIKM
2005
Springer
15 years 5 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu
GECCO
2005
Springer
189views Optimization» more  GECCO 2005»
15 years 5 months ago
Molecular programming: evolving genetic programs in a test tube
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
Byoung-Tak Zhang, Ha-Young Jang