3471 search results - page 551 / 695 » Obstacle Numbers of Graphs |
126
Voted
MVA
2007
15 years 7 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...
140
click to vote
NIPS
2004
15 years 7 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. ...
154
click to vote
SODA
2004
ACM
15 years 7 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 ...
262
click to vote
WAE
2001
15 years 7 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...
148
click to vote
UAI
2004
15 years 7 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...