583 search results - page 53 / 117 » Computing Linking Numbers of a Filtration |
CONEXT
2006
ACM
14 years 3 months ago
2006
ACM
We consider the case of a virtual world of peers that are organized in an overlay built by Delaunay Triangulation. Application layer routing is used to determine the path taken in...
GPC
2007
Springer
14 years 4 months ago
2007
Springer
This paper focuses on two problems related to QoS-aware I/O server placement in hierarchical Grid environments. Given a hierarchical network with requests from clients, the network...
ADHOCNOW
2003
Springer
14 years 3 months ago
2003
Springer
This paper models an ad-hoc network as a continuum of nodes, ignoring edge effects, to find how the traffic scales with N, the number of nodes. We obtain expressions for the traffi...
CSE
2009
IEEE
14 years 2 months ago
2009
IEEE
—Wireless sensor networks consist of a number of small wireless sensor nodes which take measurements and transmit them over wireless links. As wireless sensors are resource const...
ERSA
2006
13 years 11 months ago
2006
Abstract-- With the constantly increasing gate capacity of FPGAs, a single FPGA chip is able to employ large-scale applications. To connect a large number of computational nodes, N...