Sciweavers

564 search results - page 85 / 113
» Linear Time Algorithms for Exact Distance Transform
Sort
View
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
14 years 2 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...
ICFP
2007
ACM
14 years 10 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
RECOMB
2004
Springer
14 years 10 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
CG
2004
Springer
13 years 10 months ago
CyberTape: an interactive measurement tool on polyhedral surface
Polyhedral mesh surfaces are widely utilized to represent objects reconstructed from 3D ranged images. In computer-aided engineering, it is desired to not only observe but also me...
Charlie C. L. Wang
SAC
2005
ACM
14 years 3 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq