1688 search results - page 188 / 338 » The Complexity of Rationalizing Matchings |
SIGECOM
2003
ACM
15 years 4 months ago
2003
ACM
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
107
click to vote
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We use a simple yet powerful higher-order conditional random field (CRF) to model optical flow. It consists of a standard photoconsistency cost and a prior on affine mo...
ICSE
2010
IEEE-ACM
15 years 4 months ago
2010
IEEE-ACM
A reachability question is a search across feasible paths through a program for target statements matching search criteria. In three separate studies, we found that reachability q...
103
click to vote
NOSSDAV
2001
Springer
15 years 4 months ago
2001
Springer
Layered multicast is a common approach for dissemination of audio and video in heterogeneous network environments. Layered multicast schemes can be classified into two categories...
105
click to vote
CVPR
2000
IEEE
15 years 4 months ago
2000
IEEE
We formulate face alignment as a model-based parameter estimation problem in this paper. First, we work within a framework that combines two separate subspace models to r epresent...