Sciweavers

1333 search results - page 27 / 267
» Not a Number of Floating Point Problems
Sort
View
IPPS
1998
IEEE
15 years 4 months ago
Optimizing Data Scheduling on Processor-in-Memory Arrays
In the study of PetaFlop project, Processor-In-Memory array was proposed to be a target architecture in achieving 1015 floating point operations per second computing performance. ...
Yi Tian, Edwin Hsing-Mean Sha, Chantana Chantrapor...
101
Voted
CP
2008
Springer
15 years 2 months ago
Universal Booleanization of Constraint Models
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
Jinbo Huang
104
Voted
ICCV
2007
IEEE
16 years 2 months ago
Accurate Non-Iterative O(n) Solution to the PnP Problem
We propose a non-iterative solution to the PnP problem--the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences--whose computational complexity gro...
Francesc Moreno-Noguer, Vincent Lepetit, Pascal Fu...
INFOCOM
2000
IEEE
15 years 4 months ago
Traffic Engineering Using Multiple Multipoint-to-Point LSPs
Traffic engineering aims to optimize the utilization of existing network resources for load balance and failure recovery, and these are to be accomplished in a scalable fashion. Th...
Hiroyuki Saito, Yasuhiro Miyao, Makiko Yoshida
WADS
2007
Springer
184views Algorithms» more  WADS 2007»
15 years 6 months ago
A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanj...