592 search results - page 95 / 119 » Crossing numbers of random graphs |
180
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
144
click to vote
IDEAL
2007
Springer
15 years 11 months ago
2007
Springer
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
140
click to vote
DAC
1995
ACM
15 years 9 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...
193
click to vote
JCB
2002
15 years 5 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...
134
click to vote
DAC
2000
ACM
16 years 6 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...