31 search results - page 2 / 7 » A Fast Algorithm for MacMahon's Partition Analysis |
ICCV
2003
IEEE
14 years 6 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
BCS
2008
13 years 6 months ago
2008
In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...
ICTAI
2006
IEEE
13 years 10 months ago
2006
IEEE
We present an ensemble learning approach that achieves accurate predictions from arbitrarily partitioned data. The partitions come from the distributed processing requirements of ...
CVPR
2000
IEEE
14 years 6 months ago
2000
IEEE
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
CIKM
2008
Springer
13 years 6 months ago
2008
Springer
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...