1265 search results - page 142 / 253 » Algorithms for Drawing Media |
107
click to vote
SIGIR
2010
ACM
15 years 2 months ago
2010
ACM
We introduce in this paper the family of information-based models for ad hoc information retrieval. These models draw their inspiration from a long-standing hypothesis in IR, name...
139
click to vote
INLG
2010
Springer
15 years 1 months ago
2010
Springer
This paper discusses the basic structures necessary for the generation of reference to objects in a visual scene. We construct a study designed to elicit naturalistic referring ex...
150
click to vote
ACL
2009
15 years 1 months ago
2009
We would like to draw attention to Hidden Markov Tree Models (HMTM), which are to our knowledge still unexploited in the field of Computational Linguistics, in spite of highly suc...
201
click to vote
GREC
2009
Springer
15 years 1 months ago
2009
Springer
In this paper we present a method to robustly detect circular arcs in a line drawing image. The method is fast, robust and very reliable, and is capable of assessing the quality of...
148
click to vote
ALGORITHMICA
2011
14 years 11 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...