Sciweavers

1115 search results - page 95 / 223
» Separating Shape Graphs
Sort
View
112
Voted
3DIM
2007
IEEE
15 years 7 months ago
Generalized MPU Implicits Using Belief Propagation
In this paper, we present a new algorithm to reconstruct 3D surfaces from an unorganized point cloud based on generalizing the MPU implicit algorithm through introducing a powerfu...
Yi-Ling Chen, Shang-Hong Lai, Tung-Ying Lee
93
Voted
UIST
2009
ACM
15 years 7 months ago
Relaxed selection techniques for querying time-series graphs
Time-series graphs are often used to visualize phenomena that change over time. Common tasks include comparing values at different points in time and searching for specified patte...
Christian Holz, Steven Feiner
110
Voted
AI
2008
Springer
15 years 27 days ago
Conditional independence and chain event graphs
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...
Jim Q. Smith, Paul E. Anderson
JGAA
2007
124views more  JGAA 2007»
15 years 19 days ago
Energy Models for Graph Clustering
The cluster structure of many real-world graphs is of great interest, as the clusters may correspond e.g. to communities in social networks or to cohesive modules in software syst...
Andreas Noack
SIGMETRICS
2012
ACM
253views Hardware» more  SIGMETRICS 2012»
13 years 3 months ago
Characterizing continuous time random walks on time varying graphs
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
Daniel R. Figueiredo, Philippe Nain, Bruno F. Ribe...