Sciweavers

1523 search results - page 144 / 305
» The Computational Complexity of Linear Optics
Sort
View
TJS
2008
78views more  TJS 2008»
13 years 10 months ago
A performance study of multiprocessor task scheduling algorithms
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
Shiyuan Jin, Guy A. Schiavone, Damla Turgut
DATE
2002
IEEE
79views Hardware» more  DATE 2002»
14 years 3 months ago
Formulation of Low-Order Dominant Poles for Y-Matrix of Interconnects
This paper presents an efficient approach to compute the dominant poles for the reduced-order admittance (Y parameter) matrix of lossy interconnects. Using the global approximati...
Qinwei Xu, Pinaki Mazumder
ICCV
2011
IEEE
12 years 10 months ago
Kernel Non-Rigid Structure from Motion
Non-rigid structure from motion (NRSFM) is a difficult, underconstrained problem in computer vision. The standard approach in NRSFM constrains 3D shape deformation using a linear...
Paulo F. U. Gotardo, Aleix M. Martinez
ECCV
2008
Springer
15 years 1 days ago
A Lattice-Preserving Multigrid Method for Solving the Inhomogeneous Poisson Equations Used in Image Analysis
Abstract. The inhomogeneous Poisson (Laplace) equation with internal Dirichlet boundary conditions has recently appeared in several applications ranging from image segmentation [1,...
Leo Grady
ISBI
2008
IEEE
14 years 11 months ago
Chromosome pairing for karyotyping purposes using mutual information
Cytogenetics is the preferred tool in the diagnosis of genetic diseases such as leukemia and detection of aquired chromosomal abnormalities, such as translocations, deletions, mon...
Artem Khmelinskii, João Sanches, Rodrigo Ve...