Sciweavers

21984 search results - page 437 / 4397
» C
Sort
View
DCG
2010
67views more  DCG 2010»
15 years 7 months ago
Conformal Mapping in Linear Time
Given any > 0 and any planar region bounded by a simple n-gon P we construct a (1 + )-quasiconformal map between and the unit disk in time C()n. One can take C() = C + C log ...
Christopher J. Bishop
ENTCS
2008
139views more  ENTCS 2008»
15 years 7 months ago
Pervasive Compiler Verification - From Verified Programs to Verified Systems
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...
Dirk Leinenbach, Elena Petrova
DM
2006
73views more  DM 2006»
15 years 7 months ago
Composition of Post classes and normal forms of Boolean functions
The class composition C K of Boolean clones, being the set of composite functions f(g1, . . . , gn) with f C, g1, . . . , gn K, is investigated. This composition C K is either...
Miguel Couceiro, Stephan Foldes, Erkko Lehtonen
IJES
2008
128views more  IJES 2008»
15 years 7 months ago
On-chip implementation of multiprocessor networks and switch fabrics
: On-chipimplementationofmultiprocessorsystemsneedstoplanarisetheinterconnect networks onto the silicon floorplan. Compared with traditional ASIC/SoC architectures, Multiprocessor ...
Terry Tao Ye, Giovanni De Micheli
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
16 years 10 days ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...