817 search results - page 72 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
ISVC
2009
Springer
14 years 1 months ago
2009
Springer
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs). In this paper, we present a novel and fast 3D segment...
STOC
2002
ACM
14 years 9 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
AI
1999
Springer
13 years 8 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
NIPS
2007
13 years 10 months ago
2007
This paper investigates the application of randomized algorithms for large scale SVM learning. The key contribution of the paper is to show that, by using ideas random projections...