Sciweavers

6393 search results - page 36 / 1279
» Randomized Algorithms on the Mesh
Sort
View
COMSWARE
2007
IEEE
15 years 8 months ago
Survivable Routing in WDM Weighted Networks
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
Debasis Mandal, Satyajit Nath, Bivas Mitra
SPAA
2005
ACM
15 years 7 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
CN
2007
137views more  CN 2007»
15 years 1 months ago
Georoy: A location-aware enhancement to Viceroy peer-to-peer algorithm
The success of experiences such as Seattle and Houston Wireless has attracted the attention on the so called wireless mesh community networks. These are wireless multihop networks...
Laura Galluccio, Giacomo Morabito, Sergio Palazzo,...
SMI
2008
IEEE
107views Image Analysis» more  SMI 2008»
15 years 8 months ago
Approximate topological matching of quadrilateral meshes
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra...
IMR
2003
Springer
15 years 7 months ago
A Crystalline, Red Green Strategy for Meshing Highly Deformable Objects with Tetrahedra
Motivated by Lagrangian simulation of elastic deformation, we propose a new tetrahedral mesh generation algorithm that produces both high quality elements and a mesh that is well ...
Neil Molino, Robert Bridson, Joseph Teran, Ronald ...