1952 search results - page 189 / 391 » Complete partitions of graphs |
180
click to vote
FOCS
2007
IEEE
16 years 25 days ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
208
click to vote
WAW
2004
Springer
15 years 12 months ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
183
click to vote
CSMR
2006
IEEE
16 years 17 days ago
2006
IEEE
A trace is a record of the execution of a computer program, showing the sequence of operations executed. A trace may be obtained through static or dynamic analysis. An object trac...
171
click to vote
IAT
2006
IEEE
16 years 17 days ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
170
click to vote
CATS
2006
15 years 8 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...