Sciweavers

2509 search results - page 26 / 502
» Abstract Geometrical Computation and Computable Analysis
Sort
View
COMGEO
2004
ACM
13 years 7 months ago
Speeding up the incremental construction of the union of geometric objects in practice
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...
Eti Ezra, Dan Halperin, Micha Sharir
JUCS
2008
140views more  JUCS 2008»
13 years 7 months ago
The Computable Multi-Functions on Multi-represented Sets are Closed under Programming
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...
Klaus Weihrauch
DATE
2007
IEEE
130views Hardware» more  DATE 2007»
14 years 1 months ago
A novel criticality computation method in statistical timing analysis
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
Feng Wang 0004, Yuan Xie, Hai Ju
FCCM
2008
IEEE
165views VLSI» more  FCCM 2008»
14 years 1 months ago
Performance Analysis with High-Level Languages for High-Performance Reconfigurable Computing
High-Level Languages (HLLs) for FPGAs (FieldProgrammable Gate Arrays) facilitate the use of reconfigurable computing resources for application developers by using familiar, higher...
John Curreri, Seth Koehler, Brian Holland, Alan D....
WSC
2004
13 years 8 months ago
Computer Automated Multi-Paradigm Modelling for Analysis and Design of Traffic Networks
Computer Automated Multi-Paradigm Modelling (CAMPaM) is an enabler for domain-specific analysis and design. Traffic, a new untimed visual formalism for vehicle traffic networks, i...
Hans Vangheluwe, Juan de Lara