Sciweavers

805 search results - page 131 / 161
» Enumerating All Solutions for Constraint Satisfaction Proble...
Sort
View
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
11 years 11 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
ECCV
2006
Springer
14 years 10 months ago
Optimal Multi-frame Correspondence with Assignment Tensors
Abstract. Establishing correspondence between features of a set of images has been a long-standing issue amongst the computer vision community. We propose a method that solves the ...
R. Oliveira, R. Ferreira, J. P. Costeira
HIPC
2003
Springer
14 years 1 months ago
A Parallel Iterative Improvement Stable Matching Algorithm
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
Enyue Lu, S. Q. Zheng
CVPR
2009
IEEE
15 years 4 months ago
Recognizing Linked Events: Searching the Space of Feasible Explanations
The ambiguity inherent in a localized analysis of events from video can be resolved by exploiting constraints between events and examining only feasible global explanations. We sho...
Dima Damen (University of Leeds), David Hogg (Univ...
ATAL
2009
Springer
14 years 3 months ago
Constraint-based dynamic programming for decentralized POMDPs with structured interactions
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
Akshat Kumar, Shlomo Zilberstein