1402 search results - page 197 / 281 » Sparse-Memory Graph Search |
127
click to vote
MM
2005
ACM
15 years 8 months ago
2005
ACM
Learning the user’s semantics for CBIR involves two different sources of information: the similarity relations entailed by the content-based features, and the relevance relatio...
126
Voted
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
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...
145
Voted
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
133
Voted
COCOON
2003
Springer
15 years 7 months ago
2003
Springer
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
150
Voted
AI
2011
Springer
14 years 9 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...