4131 search results - page 466 / 827 » Compactness in Topology and Computation |
150
click to vote
CCA
2005
Springer
16 years 11 days ago
2005
Springer
In the Type-2 Theory of Effectivity, one considers representations of topological spaces in which infinite words are used as “names” for the elements they represent. Given s...
185
click to vote
ICAPR
2005
Springer
16 years 10 days ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
142
click to vote
IPTPS
2005
Springer
16 years 10 days ago
2005
Springer
A great deal of work has been done to improve peerto-peer routing by strategically moving or replicating content. However, there are many applications for which a peer-to-peer arc...
164
click to vote
STACS
2005
Springer
16 years 9 days ago
2005
Springer
Abstract. We present a mathematical model to analyse the establishment and maintenance of communication between mobile agents. We assume that the agents move through a fixed envir...
171
click to vote
DMSN
2004
ACM
16 years 8 days ago
2004
ACM
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...