Sciweavers

640 search results - page 128 / 128
» Topology Without Tears
Sort
View
COMPGEOM
2011
ACM
12 years 8 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
INFOCOM
2011
IEEE
12 years 8 months ago
Experimental evaluation of optimal CSMA
Abstract—By ‘optimal CSMA’ we denote a promising approach to maximize throughput-based utility in wireless networks without message passing or synchronization among nodes. De...
Bruno Nardelli, Jinsung Lee, Kangwook Lee, Yung Yi...
ICC
2011
IEEE
201views Communications» more  ICC 2011»
12 years 4 months ago
Survivable Optical Grid Dimensioning: Anycast Routing with Server and Network Failure Protection
Abstract—Grids can efficiently deal with challenging computational and data processing tasks which cutting edge science is generating today. So-called e-Science grids cope with ...
Chris Develder, Jens Buysse, Ali Shaikh, Brigitte ...
P2P
2008
IEEE
222views Communications» more  P2P 2008»
13 years 11 months ago
IgorFs: A Distributed P2P File System
IgorFs is a distributed, decentralized peer-to-peer (P2P) file system that is completely transparent to the user. It is built on top of the Igor peer-to-peer overlay network, whi...
Bernhard Amann, Benedikt Elser, Yaser Houri, Thoma...
COMPGEOM
2004
ACM
13 years 10 months ago
On locally Delaunay geometric graphs
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Rom Pinchasi, Shakhar Smorodinsky