Sciweavers

530 search results - page 77 / 106
» Structural and Complexity Aspects of Line Systems of Graphs
Sort
View
97
Voted
ISCA
2005
IEEE
135views Hardware» more  ISCA 2005»
15 years 7 months ago
Deconstructing Commodity Storage Clusters
The traditional approach for characterizing complex systems is to run standard workloads and measure the resulting performance as seen by the end user. However, unique opportuniti...
Haryadi S. Gunawi, Nitin Agrawal, Andrea C. Arpaci...
AIRWEB
2009
Springer
15 years 8 months ago
Tag spam creates large non-giant connected components
Spammers in social bookmarking systems try to mimick bookmarking behaviour of real users to gain the attention of other users or search engines. Several methods have been proposed...
Nicolas Neubauer, Robert Wetzker, Klaus Obermayer
ATAL
2007
Springer
15 years 8 months ago
Matrix-based representation for coordination fault detection: a formal approach
Teamwork requires that team members coordinate their actions. The representation of the coordination is a key requirement since it influences the complexity and flexibility of r...
Meir Kalech, Michael Lindner, Gal A. Kaminka
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
15 years 6 months ago
Optimal equivalent circuits for interconnect delay calculations using moments
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
Sudhakar Muddu, Andrew B. Kahng
PODC
2010
ACM
15 years 5 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela