1056 search results - page 191 / 212 » Constraint-Based Graph Matching |
NIPS
2004
13 years 10 months ago
2004
Co-training is a method for combining labeled and unlabeled data when examples can be thought of as containing two distinct sets of features. It has had a number of practical succ...
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. ...
MM
2010
ACM
13 years 9 months ago
2010
ACM
This paper presents a method to render artistic paper-cut of human portraits. Rendering paper-cut images from photographs can be considered as an inhomogeneous image binarization ...
ALGORITHMICA
2006
13 years 9 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...