2542 search results - page 419 / 509 » Computing Cartograms with Optimal Complexity |
CVPR
2006
IEEE
15 years 3 days ago
2006
IEEE
We address the problem of detecting complex articulated objects and their pose in 3D range scan data. This task is very difficult when the orientation of the object is unknown, an...
DLOG
2004
13 years 11 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
PADL
2012
Springer
12 years 5 months ago
2012
Springer
In the past, the creators of numerical programs had to choose between simple expression of mathematical formulas and static type checking. While the Lisp family and its dynamically...
IPPS
2009
IEEE
14 years 4 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
EUROPAR
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. Today’s parallel computers with SMP nodes provide both multithreading and message passing as their modes of parallel execution. As a consequence, performance analysis a...