Sciweavers

1075 search results - page 43 / 215
» Calculating the Number of Tunnels
Sort
View
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
13 years 3 months ago
Approximation Algorithms for Scheduling Parallel Jobs
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
Klaus Jansen, Ralf Thöle
JCT
2006
100views more  JCT 2006»
13 years 8 months ago
Enumeration of unrooted maps of a given genus
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
Alexander Mednykh, Roman Nedela
ICCAD
2004
IEEE
107views Hardware» more  ICCAD 2004»
14 years 5 months ago
Computation of signal threshold crossing times directly from higher order moments
—This paper introduces a simple method for calculating the times at which any signal crosses a prespecified threshold voltage (e.g., 10%, 20%, 50%, etc.) directly from the moment...
Yehea I. Ismail, Chirayu S. Amin
ICPR
2008
IEEE
14 years 2 months ago
The structure analysis of ultra thin magnetic film images
Algorithm of magnetic structure extraction and analysis in ultra thin magnetic film images is proposed. This algorithm allows to gain successful results and calculates a large num...
Alexandr Nedzved, Sergey Ablameyko, Alexei Belotse...
3DIM
2001
IEEE
14 years 5 days ago
The Parallel Iterative Closest Point Algorithm
This paper describes a parallel implementation developed to improve the time performance of the Iterative Closest Point Algorithm. Within each iteration, the correspondence calcul...
Christian Langis, Michael A. Greenspan, Guy Godin