Sciweavers

945 search results - page 103 / 189
» Graph Types
Sort
View
104
Voted
RANDOM
1998
Springer
15 years 6 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
EUROSYS
2010
ACM
15 years 6 months ago
Locating cache performance bottlenecks using data profiling
Effective use of CPU data caches is critical to good performance, but poor cache use patterns are often hard to spot using existing execution profiling tools. Typical profilers at...
Aleksey Pesterev, Nickolai Zeldovich, Robert T. Mo...
CCS
2009
ACM
16 years 3 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
151
Voted
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
13 years 4 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
105
Voted
IV
2003
IEEE
118views Visualization» more  IV 2003»
15 years 7 months ago
Tools for Visual Comparison of Spatial Development Scenarios
In the paper, we suggest a set of visualization-based exploratory tools to support analysis and comparison of different spatial development scenarios, such as results of simulatio...
Natalia V. Andrienko, Gennady L. Andrienko, Peter ...