406 search results - page 32 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
122
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
164
click to vote
ATMOS
2010
15 years 3 months ago
2010
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
149
click to vote
PAMI
2010
15 years 2 months ago
2010
—This paper proposes a framework for single-image super-resolution. The underlying idea is to learn a map from input low-resolution images to target high-resolution images based ...
151
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
131
click to vote
CSC
2008
15 years 5 months ago
2008
Many applications of Mathematical Physics and Engineering are connected with the Laplacian, however, the most part of BVP relevant to the Laplacian are solved in explicit form onl...