3211 search results - page 508 / 643 » On the Grundy Number of a Graph |
NIPS
2008
13 years 10 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
MVA
2007
13 years 10 months ago
2007
This paper presents a new reliable detection of core and delta in fingerprints by candidate analysis. The line search based method, which is one of the reliable approaches to dete...
NIPS
2004
13 years 10 months ago
2004
The formation of disulphide bridges among cysteines is an important feature of protein structures. Here we develop new methods for the prediction of disulphide bond connectivity. ...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
WAE
2001
13 years 10 months ago
2001
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...