430 search results - page 71 / 86 » formats 2005 |
93
Voted
TALG
2008
14 years 10 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
BC
2005
14 years 10 months ago
2005
Weextendthetheoryofself-organizingneuralfields in order to analyze the joint emergence of topography and feature selectivity in primary visual cortex through spontaneous symmetry b...
BMCBI
2005
14 years 10 months ago
2005
Background: Computational methods for problem solving need to interleave information access and algorithm execution in a problem-specific workflow. The structures of these workflo...
BMCBI
2005
14 years 10 months ago
2005
Background: Assignment of function to new molecular sequence data is an essential step in genomics projects. The usual process involves similarity searches of a given sequence aga...
100
Voted
SOUPS
2005
ACM
15 years 3 months ago
2005
ACM
In this article, we describe the design process of Reno, a location-enhanced, mobile coordination tool and person finder. The design process included three field experiments: a ...