Sciweavers

2638 search results - page 7 / 528
» Random Geometric Complexes
Sort
View
WAW
2004
Springer
96views Algorithms» more  WAW 2004»
14 years 12 days ago
A Geometric Preferential Attachment Model of Networks
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
Abraham Flaxman, Alan M. Frieze, Juan Vera
COMCOM
2006
147views more  COMCOM 2006»
13 years 7 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
PPL
2000
110views more  PPL 2000»
13 years 6 months ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna
DM
2007
87views more  DM 2007»
13 years 7 months ago
Gaps in samples of geometric random variables
In this note we continue the study of gaps in samples of geometric random variables originated in Hitczenko and Knopfmacher [Gap-free compositions and gap-free samples of geometri...
William M. Y. Goh, Pawel Hitczenko
ICMCS
2005
IEEE
87views Multimedia» more  ICMCS 2005»
14 years 20 days ago
Correlation-based model of color picture watermarking against random geometric distortion
Random geometric distortion is one of the most difficult kinds of image processing to survive and has been a noted problem in watermarking research. Previous methods for dealing ...
Isao Echizen, Yasuhiro Fujii, Takaaki Yamada, Sato...