4212 search results - page 603 / 843 » On Compressible Pairings and Their Computation |
174
click to vote
COLING
2010
15 years 1 months ago
2010
We present a novel Evaluation Metric for Morphological Analysis (EMMA) that is both linguistically appealing and empirically sound. EMMA uses a graphbased assignment algorithm, op...
255
click to vote
DASIP
2010
15 years 1 months ago
2010
In order to obtain depth perception in computer vision, one needs to process pairs of stereo images. This process is computationally challenging to be carried out in real-time as i...
223
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
Recovering 3D geometry from a single view of an object is an important and challenging problem in computer vision. Previous methods mainly focus on one specific class of objects ...
213
click to vote
SAC
2011
ACM
14 years 9 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
220
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Proxemics is the study of how people interact. We present a computational formulation of visual proxemics by attempting to label each pair of people in an image with a subset of p...