Sciweavers

2498 search results - page 199 / 500
» Algorithms for the Topological Watershed
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Fully distributed EM for very large datasets
In EM and related algorithms, E-step computations distribute easily, because data items are independent given parameters. For very large data sets, however, even storing all of th...
Jason Wolfe, Aria Haghighi, Dan Klein
ICML
1995
IEEE
16 years 7 months ago
Visualizing High-Dimensional Structure with the Incremental Grid Growing Neural Network
Understanding high-dimensional real world data usually requires learning the structure of the data space. The structure maycontain high-dimensional clusters that are related in co...
Justine Blackmore, Risto Miikkulainen
GBRPR
2009
Springer
16 years 1 months ago
Computing and Visualizing a Graph-Based Decomposition for Non-manifold Shapes
Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval. The topological structure of a non-manifold shape can be analyzed through its...
Leila De Floriani, Daniele Panozzo, Annie Hui
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
16 years 1 months ago
Average consensus over small world networks: A probabilistic framework
— It has been observed that adding a few long range edges to certain graph topologies can significantly increase the rate of convergence for consensus algorithms. A notable exam...
Pedram Hovareshti, John S. Baras, Vijay Gupta
ICDM
2008
IEEE
121views Data Mining» more  ICDM 2008»
16 years 1 months ago
Unifying Unknown Nodes in the Internet Graph Using Semisupervised Spectral Clustering
Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different m...
Anat Almog, Jacob Goldberger, Yuval Shavitt