Sciweavers

851 search results - page 4 / 171
» Random constructions and density results
Sort
View
VC
2008
103views more  VC 2008»
13 years 7 months ago
GPU-based rendering of point-sampled water surfaces
Particle-based simulations are widely used to simulate fluids. We present a real-time rendering method for the results of particle-based simulations of water. Traditional approache...
Kei Iwasaki, Yoshinori Dobashi, Fujiichi Yoshimoto...
AAAI
2008
13 years 9 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
COMBINATORICA
2011
12 years 7 months ago
On the chromatic number of random geometric graphs
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
Colin McDiarmid, Tobias Müller
CP
2000
Springer
13 years 11 months ago
Random 3-SAT: The Plot Thickens
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
Cristian Coarfa, Demetrios D. Demopoulos, Alfonso ...
EWSN
2006
Springer
14 years 7 months ago
Sensor Density for Complete Information Coverage in Wireless Sensor Networks
Abstract. Coverage is a very important issue in wireless sensor networks. Current literature defines a point to be covered if it is within the sensing radius of at least one sensor...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan, Wei...