Sciweavers

763 search results - page 65 / 153
» Engineering Shortest Path Algorithms
Sort
View
DAC
2004
ACM
15 years 11 months ago
Optical proximity correction (OPC): friendly maze routing
As the technology migrates into the deep submicron manufacturing (DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoid...
Li-Da Huang, Martin D. F. Wong
CVPR
2009
IEEE
17 years 1 months ago
Extraction of Tubular Structures over an Orientation Domain
This paper presents a new method to extract a network of vessels centerlines from a medical image. The network is composed of local geodesics over a four-dimensional space that in...
Gabriel Peyré, Mickaël Péchaud,...
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
15 years 11 months ago
Clustering Objects on a Spatial Network
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. Th...
Man Lung Yiu, Nikos Mamoulis
CAV
2001
Springer
107views Hardware» more  CAV 2001»
15 years 10 months ago
Job-Shop Scheduling Using Timed Automata
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
Yasmina Abdeddaïm, Oded Maler
NOMS
2000
IEEE
141views Communications» more  NOMS 2000»
15 years 10 months ago
IconoNET: a tool for automated bandwidth allocation planning
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...
Christian Frei, Boi Faltings, George Melissargos, ...