Sciweavers

5595 search results - page 912 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ICCV
2009
IEEE
15 years 4 months ago
Quasi-periodic event analysis for social game retrieval
A new problem of retrieving social games from unstructured videos is proposed. Social games are characterized by repetitions (with variations) of alternating turns between two pla...
Ping Wang, Gregory D. Abowd, James M. Rehg
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 1 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
ICASSP
2011
IEEE
14 years 10 months ago
Predictive modeling of the spatiotemporal evolution of an environmental hazard and its sensor network implementation
Predicting accurately the spatiotemporal evolution of a diffusive environmental hazard is of paramount importance for its effective containment. We approximate the front line of a...
Dimitris V. Manatakis, Elias S. Manolakos
ICASSP
2011
IEEE
14 years 10 months ago
Distributed linear discriminant analysis
Linear discriminant analysis (LDA) is a widely used feature extraction method for classification. We introduce distributed implementations of different versions of LDA, suitable ...
Sergio Valcarcel Macua, Pavle Belanovic, Santiago ...
CVPR
2007
IEEE
16 years 8 months ago
Graph Cut Based Optimization for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
Olga Veksler