Sciweavers

604 search results - page 71 / 121
» The Hardness of Metric Labeling
Sort
View
JCO
2010
101views more  JCO 2010»
13 years 6 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
PAMI
2010
249views more  PAMI 2010»
13 years 6 months ago
Object Detection with Discriminatively Trained Part-Based Models
—We describe an object detection system based on mixtures of multiscale deformable part models. Our system is able to represent highly variable object classes and achieves state-...
Pedro F. Felzenszwalb, Ross B. Girshick, David A. ...
PROCEDIA
2010
80views more  PROCEDIA 2010»
13 years 6 months ago
Visualising spins and clusters in regular and small-world Ising models with GPUs
Visualising computational simulation models of solid state physical systems is a hard problem for dense lattice models. Fly throughs and cutaways can aid viewer understanding of a...
Arno Leist, Daniel P. Playne, Kenneth A. Hawick
SAC
2010
ACM
13 years 2 months ago
A study on interestingness measures for associative classifiers
Associative classification is a rule-based approach to classify data relying on association rule mining by discovering associations between a set of features and a class label. Su...
Mojdeh Jalali Heravi, Osmar R. Zaïane
ICCV
2009
IEEE
15 years 26 days ago
Learning Deformable Action Templates from Crowded Videos
In this paper, we present a Deformable Action Template (DAT) model that is learnable from cluttered real-world videos with weak supervisions. In our generative model, an action ...
Benjamin Yao, Song-Chun Zhu