617 search results - page 100 / 124 » On the Chromatic Number of Random Graphs |
165
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
126
click to vote
DAC
1995
ACM
15 years 7 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
174
Voted
JCB
2002
15 years 3 months ago
2002
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
123
click to vote
DAC
2000
ACM
16 years 5 months ago
2000
ACM
Recently, intellectual property protection (IPP) techniques attracted a great deal of attention from semiconductor, system integration and software companies. A number of watermar...
184
click to vote
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...