Sciweavers

2877 search results - page 401 / 576
» The Complexity of Planarity Testing
Sort
View
NCA
2005
IEEE
15 years 10 months ago
Reducing the Communication Cost via Chain Pattern Scheduling
This paper deals with general nested loops and proposes a novel scheduling methodology for reducing the communication cost of parallel programs. General loops contain complex loop...
Florina M. Ciorba, Theodore Andronikos, Ioannis Dr...
VL
2005
IEEE
159views Visual Languages» more  VL 2005»
15 years 9 months ago
Executable Visual Contracts
Design by Contract (DbC) is widely acknowledged to be a powerful technique for creating reliable software. DbC allows developers to specify the behavior of an operation precisely ...
Marc Lohmann, Stefan Sauer, Gregor Engels
WACV
2005
IEEE
15 years 9 months ago
A Hierarchical Approach to Sign Recognition
Sighted individuals draw a significant amount of information from signs but this information is denied to the visually impaired. VIDI is an evolving system for detecting and reco...
Piyanuch Silapachote, Allen R. Hanson, Richard S. ...
WETICE
2005
IEEE
15 years 9 months ago
Challenges and Solutions for Model Driven Web Service Composition
System theory propagates the use of models which e level of abstraction to cope with complexity, evolving out of variety and connectivity. Different modeling techniques have been ...
Konrad Pfadenhauer, Burkhard Kittl, Schahram Dustd...
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
15 years 9 months ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...