Sciweavers

144 search results - page 11 / 29
» Sampling Techniques for Large, Dynamic Graphs
Sort
View
VISUALIZATION
2000
IEEE
15 years 4 months ago
Interactive visualization of protein dynamics
The study of time dependent characteristics of proteins is important for gaining insight into many biological processes. However, visualizing protein dynamics by animating atom tr...
Henk Huitema, Robert van Liere
NIPS
2001
15 years 1 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi
117
Voted
SI3D
2010
ACM
15 years 7 months ago
Volumetric obscurance
Obscurance and Ambient Occlusion (AO) are popular techniques in both film and games that model how ambient light is shadowed. While it is largely a solved problem for static scen...
Bradford James Loos, Peter-Pike Sloan
90
Voted
CG
2004
Springer
15 years 7 days ago
Hierarchical graph maps
nd maps are powerful abstractions. Their combination, Hierarchical Graph Maps, provide effective tools to process a graph that is too large to fit on the screen. They provide hier...
James Abello
148
Voted
TEC
2012
234views Formal Methods» more  TEC 2012»
13 years 2 months ago
Cooperatively Coevolving Particle Swarms for Large Scale Optimization
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...
Xiaodong Li, Xin Yao