Sciweavers

32 search results - page 5 / 7
» Localizing Combinatorial Properties for Partitions on Block ...
Sort
View
JSAT
2008
122views more  JSAT 2008»
13 years 7 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
HPDC
2009
IEEE
14 years 2 months ago
Maintaining reference graphs of globally accessible objects in fully decentralized distributed systems
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
Björn Saballus, Thomas Fuhrmann
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
11 years 9 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
CORR
2011
Springer
217views Education» more  CORR 2011»
12 years 11 months ago
Coarse-Grained Topology Estimation via Graph Sampling
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this a...
Maciej Kurant, Minas Gjoka, Yan Wang, Zack W. Almq...
ISVD
2007
IEEE
14 years 1 months ago
Voronoi Diagram with Respect to Criteria on Vision Information
Voronoi diagram for a set of geometric objects is a partition of the plane (or space in higher dimensions) into disjoint regions each dominated by some given object under a predet...
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi T...