3055 search results - page 568 / 611 » Randomized Search Trees |
BMCBI
2011
13 years 5 months ago
2011
Background: As the canonical code is not universal, different theories about its origin and organization have appeared. The optimization or level of adaptation of the canonical ge...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
BMCBI
2007
13 years 10 months ago
2007
Background: Biomedical ontologies are being widely used to annotate biological data in a computer-accessible, consistent and well-defined manner. However, due to their size and co...
CVPR
2007
IEEE
15 years 3 days ago
2007
IEEE
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
CVPR
2007
IEEE
15 years 3 days ago
2007
IEEE
Considerable advances have been made in learning to recognize and localize visual object classes. Simple bag-offeature approaches label each pixel or patch independently. More adv...