Sciweavers

4009 search results - page 277 / 802
» Clustering on Complex Graphs
Sort
View
IPPS
1999
IEEE
15 years 11 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
SOFSEM
2007
Springer
16 years 24 days ago
Games, Time, and Probability: Graph Models for System Design and Analysis
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
Thomas A. Henzinger
CEC
2005
IEEE
16 years 9 days ago
A parallel Monte Carlo simulation on cluster systems for financial derivatives pricing
In recent years the complexity of numerical computations in computational financial applications has been increased enormously. Monte Carlo algorithm is one of main tools in comput...
Jin Suk Kim, Suk Joon Byun
TCS
2008
15 years 6 months ago
Main-memory triangle computations for very large (sparse (power-law)) graphs
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
Matthieu Latapy
ICCV
2007
IEEE
16 years 8 months ago
Non-Parametric Probabilistic Image Segmentation
We propose a simple probabilistic generative model for image segmentation. Like other probabilistic algorithms (such as EM on a Mixture of Gaussians) the proposed model is princip...
Marco Andreetto, Lihi Zelnik-Manor, Pietro Perona