Sciweavers

2638 search results - page 189 / 528
» Random Geometric Complexes
Sort
View
COMCOM
2008
91views more  COMCOM 2008»
15 years 6 months ago
A WEP post-processing algorithm for a Robust 802.11 WLAN implementation
Wired Equivalent Privacy (WEP) protocol used within the IEEE 802.11 standard has "major security flaws" thus wireless local area networks (WLANs) using the protocol are ...
Taskin Koçak, Mohit Jagetia
INFOCOM
2005
IEEE
16 years 2 days ago
Perfect simulation and stationarity of a class of mobility models
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
Jean-Yves Le Boudec, Milan Vojnovic
PODC
2009
ACM
16 years 7 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
GRAPHITE
2004
ACM
15 years 12 months ago
Robust, geometry-independent shadow volumes
A novel algorithm is presented that overcomes limitations of existing shadow volume algorithms when dealing with nonmanifold geometry and space partitioning. This simple algorithm...
Graham Aldridge, Eric Woods
VL
1993
IEEE
147views Visual Languages» more  VL 1993»
15 years 10 months ago
Fractal Approaches for Visualizing Huge Hierarchies
This paper describes fractal approaches to the problems which associate with visualizing huge hierarchies. The geometrical characteristic of a fractal, selfsimilarity, allows user...
Hideki Koike, Hirotaka Yoshihara