Sciweavers

246 search results - page 38 / 50
» Bichain graphs: Geometric model and universal graphs
Sort
View
MSWIM
2006
ACM
16 years 1 days ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
COMPGEOM
2004
ACM
15 years 11 months ago
Single-strip triangulation of manifolds with arbitrary topology
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
David Eppstein, M. Gopi
INFOCOM
2007
IEEE
16 years 11 days ago
Detecting Wormhole Attacks in Wireless Networks Using Connectivity Information
Abstract—We propose a novel algorithm for detecting wormhole attacks in wireless multi-hop networks. The algorithm uses only connectivity information to look for forbidden substr...
Ritesh Maheshwari, Jie Gao, Samir R. Das
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
Multi-Scale Geometry Interpolation
Interpolating vertex positions among triangle meshes with identical vertex-edge graphs is a fundamental part of many geometric modelling systems. Linear vertex interpolation is ro...
Tim Winkler, J. Drieseberg, Marc Alexa, Kai Horman...
164
Voted
SASO
2008
IEEE
16 years 13 days ago
Empirical Characterization of Discretization Error in Gradient-Based Algorithms
Many self-organizing and self-adaptive systems use the biologically inspired “gradient” primitive, in which each device in a network estimates its distance to the closest devi...
Jonathan Bachrach, Jacob Beal, Joshua Horowitz, Da...