489 search results - page 73 / 98 » Support tools for graphs in computer science |
131
click to vote
SDM
2009
SIAM
15 years 10 months ago
2009
SIAM
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
118
click to vote
PPSC
1993
15 years 2 months ago
1993
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solvee ectively on massivelyparallel machines. Rather than trying to design a black box" ...
113
click to vote
PODC
2009
ACM
15 years 8 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
C5
2008
IEEE
15 years 7 months ago
2008
IEEE
End-user scripting languages are relatively easy to learn, but have limited expressive power. Tile-based scripting systems are particularly accessible to beginners, but usually ar...
118
click to vote
PODC
2010
ACM
15 years 5 months ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...