1197 search results - page 209 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
PG
2002
IEEE
14 years 28 days ago
2002
IEEE
This paper addresses the problem of 3D reconstruction from a set of viewpoints on a short baseline. Its main contribution is the development of a robust algorithm which can extrac...
LREC
2010
13 years 9 months ago
2010
In the paper we investigate the impact of data size on a Word Sense Disambiguation task (WSD). We question the assumption that the knowledge acquisition bottleneck, which is known...
STOC
2010
ACM
14 years 27 days ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—Epidemics dynamics can describe the dissemination of information in delay tolerant networks, in peer to peer networks and in content delivery networks. The control of such dynam...
WWW
2003
ACM
14 years 8 months ago
2003
ACM
The growing infrastructure for Web Services assumes a "programmer in the loop" that hardcodes the connections between Web Services and directly programs Web Service comp...