Sciweavers

4131 search results - page 165 / 827
» Compactness in Topology and Computation
Sort
View
WABI
2001
Springer
124views Bioinformatics» more  WABI 2001»
15 years 11 months ago
Computing Linking Numbers of a Filtration
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...
Herbert Edelsbrunner, Afra Zomorodian
INFOCOM
2003
IEEE
15 years 11 months ago
Algorithms for Computing QoS Paths with Restoration
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
Yigal Bejerano, Yuri Breitbart, Rajeev Rastogi, Al...
JSSPP
2004
Springer
15 years 11 months ago
Multi-toroidal Interconnects: Using Additional Communication Links to Improve Utilization of Parallel Computers
Three-dimensional torus is a common topology of network interconnects of multicomputers due to its simplicity and high scalability. A parallel job submitted to a three-dimensional...
Yariv Aridor, Tamar Domany, Oleg Goldshmidt, Edi S...
AFRIGRAPH
2007
ACM
15 years 10 months ago
Generic computation of bulletin boards into geometric kernels
Nowadays, many commercial CAD systems are built on proprietary geometric kernels which provide an API containing a set of high level geometric operations (boolean operations, slot...
Mehdi Baba-ali, David Marcheix, Xavier Skapin, Yve...
DAC
2008
ACM
16 years 7 months ago
Topological routing to maximize routability for package substrate
Compared with on-chip routers, the existing commercial tools for off-chip routing have a much lower routability and often result in a large number of unrouted nets for manual rout...
Shenghua Liu, Guoqiang Chen, Tom Tong Jing, Lei He...