1951 search results - page 72 / 391 » An algorithm for improving graph partitions |
145
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
165
click to vote
PE
2011
Springer
14 years 11 months ago
2011
Springer
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
129
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
158
click to vote
MVA
2007
15 years 5 months ago
2007
In this paper we propose an image segmentation algorithm that combines region merging with spectral-based techniques. An initial partitioning of the image into primitive regions i...
156
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...