6393 search results - page 56 / 1279 » Randomized Algorithms on the Mesh |
108
click to vote
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
We study the cover time of a random walk on the random digraph Dn,p when np =
120
click to vote
PG
2007
IEEE
15 years 9 months ago
2007
IEEE
A new geometry-based finite difference method for a fast and reliable detection of perceptually salient curvature extrema on surfaces approximated by dense triangle meshes is pro...
132
click to vote
IMR
1998
Springer
15 years 7 months ago
1998
Springer
In this paper we introduce and discuss a graph structure associated with longest-edge algorithms (algorithms based on the bisection of triangles by the longest-edge) which can be u...
145
click to vote
ICC
2011
IEEE
14 years 2 months ago
2011
IEEE
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
114
click to vote
ICC
2008
IEEE
15 years 9 months ago
2008
IEEE
— Wireless routers equipped with smart antennas are capable of forming beams to neighboring devices to transmit/receive multiple packets simultaneously, hence achieving high netw...