332 search results - page 41 / 67 » Complexity analysis of a decentralised graph colouring algor... |
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
We are building an interactive, visual text analysis tool that aids users in analyzing a large collection of text. Unlike existing work in text analysis, which focuses either on d...
DAC
1994
ACM
13 years 11 months ago
1994
ACM
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
CVPR
2000
IEEE
14 years 2 days ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...