5606 search results - page 189 / 1122 » Randomization Techniques for Graphs. |
112
click to vote
COCO
2004
Springer
15 years 6 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
114
click to vote
QOFIS
2000
Springer
15 years 4 months ago
2000
Springer
In this paper we present an optimisation approach to congestion flow control. The initial context of this approach was as a rate based flow control in ATM networks. We describe te...
103
click to vote
PRL
2006
15 years 19 days ago
2006
Receiver Operating Characteristics (ROC) graphs are a useful technique for organizing classifiers and visualizing their performance. ROC graphs have been used in cost-sensitive le...
134
click to vote
ADHOCNOW
2004
Springer
15 years 6 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
TSMC
1998
15 years 10 days ago
1998
: This paper presents a procedure for automatically drawing directed graphs. Our system, CG, uses a unique clan-based graph decomposition to determine intrinsic substructures (clan...