6542 search results - page 160 / 1309 » The tao of parallelism in algorithms |
211
click to vote
DFG
1992
Springer
15 years 10 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
168
click to vote
ICIP
1998
IEEE
16 years 8 months ago
1998
IEEE
In this paper, human facial articulation models are derived from frontal and side view image sequences using connected vibrations non-rigid motion tracking algorithm. First, a 3D ...
267
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
This paper presents the first theoretical study, on using local-recoding generalization (LRG) to compute a kanonymous table with quality guarantee. First, we prove that it is NP-h...
153
click to vote
ISAAC
2005
Springer
16 years 1 days ago
2005
Springer
We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the Mendelian Law of Inheritance and the minimum recombinant...
135
click to vote
ICCAD
1996
IEEE
15 years 10 months ago
1996
IEEE
This paper presents a new approach for diagnosing stuck-at and short faults in interconnects whose layouts are known. This structural approach exploits dierent graph coloring and ...