161 search results - page 4 / 33 » Setting port numbers for fast graph exploration |
CASES
2006
ACM
14 years 1 months ago
2006
ACM
Developing an optimizing compiler for a newly proposed architecture is extremely difficult when there is only a simulator of the machine available. Designing such a compiler requ...
PODC
2012
ACM
11 years 10 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
Discovering coherent gene expression patterns in time-series gene expression data is an important task in bioinformatics research and biomedical applications. In this paper, we pr...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Wikipedia is an example of the large, collaborative, semi-structured data sets emerging on the Web. Typically, before these data sets can be used, they must transformed into struc...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Understanding how a single edge deletion can affect the connectivity of a graph amounts to finding the graph bridges. But when faced with d > 1 deletions, can we establish as ...