4212 search results - page 234 / 843 » On Compressible Pairings and Their Computation |
166
click to vote
AAAI
2000
15 years 8 months ago
2000
We analyze a corpus of referring expressions collected from user interactions with a multimodal travel guide application. The analysis suggests that, in dramatic contrast to norma...
186
click to vote
MVA
1996
15 years 8 months ago
1996
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...
183
Voted
COMGEO
2011
ACM
15 years 1 months ago
2011
ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
147
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
159
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
In this paper we compare and analyze the various diversity measures used in the Evolutionary Computation field. While each measure looks quite different from the others in form, we...