1920 search results - page 102 / 384 » The Complexity of the A B C Problem |
138
click to vote
GEOINFORMATICA
2006
15 years 6 months ago
2006
This paper investigates how portability of a model between different computer operating systems can lead to increased efficiency in code execution. The portability problem is not a...
136
click to vote
SYNTHESE
2008
15 years 6 months ago
2008
Hitchcock advances a diachronic Dutch Book argument (DDB) for a 1/3 answer to the Sleeping Beauty problem. Bradley and Leitgeb argue that Hitchcock's DDB argument fails. We de...
177
click to vote
CAP
2010
15 years 1 months ago
2010
We present a parallel algorithm for exact division of sparse distributed polynomials on a multicore processor. This is a problem with significant data dependencies, so our solutio...
192
Voted
CCCG
2007
15 years 7 months ago
2007
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
163
click to vote
VIS
2007
IEEE
16 years 7 months ago
2007
IEEE
We propose a novel, geometrically adaptive method for surface reconstruction from noisy and sparse point clouds, without orientation information. The method employs a fast convecti...