4110 search results - page 133 / 822 » Efficient algorithms for the 2-gathering problem |
155
click to vote
SIGGRAPH
1997
ACM
15 years 8 months ago
1997
ACM
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
144
click to vote
INFOCOM
1999
IEEE
15 years 8 months ago
1999
IEEE
Video delivery from a server to a client across a network is an important component of many multimedia applications. While delivering a video stream across a resource constrained ...
119
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE and d-RPACK) studied in the literature. Our algorithms are highly eff...
107
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...
144
click to vote
COLING
2010
14 years 11 months ago
2010
In statistical machine translation, decoding without any reordering constraint is an NP-hard problem. Inversion Transduction Grammars (ITGs) exploit linguistic structure and can w...