824 search results - page 128 / 165 » Weighted Low-Rank Approximations |
113
click to vote
NIPS
2007
15 years 1 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
BC
1998
14 years 11 months ago
1998
In many cases the distribution of saccadic reaction times (SRT) deviates considerably from a unimodal distribution and may often exhibit several peaks. We present a statistical app...
PAMI
2010
14 years 10 months ago
2010
In this paper, we address the tasks of detecting, segmenting, parsing, and matching deformable objects. We use a novel probabilistic object model that we call a hierarchical defor...
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
109
click to vote
CPM
2005
Springer
15 years 1 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...