Sciweavers

1882 search results - page 282 / 377
» Transformational Programming and Forests
Sort
View
CSR
2009
Springer
15 years 11 months ago
Variations on Muchnik's Conditional Complexity Theorem
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
Daniil Musatov, Andrei E. Romashchenko, Alexander ...
AINA
2008
IEEE
15 years 11 months ago
WS-BPEL Process Compiler for Resource-Constrained Embedded Systems
Process management and workflow systems play an important role in the composition of services in business as well as automation environments. Processes are designed using tools a...
Hendrik Bohn, Andreas Bobek, Frank Golatowski
SEFM
2008
IEEE
15 years 11 months ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...
DATE
2007
IEEE
185views Hardware» more  DATE 2007»
15 years 11 months ago
An ILP formulation for system-level application mapping on network processor architectures
Current day network processors incorporate several architectural features including symmetric multi-processing (SMP), block multi-threading, and multiple memory elements to suppor...
Christopher Ostler, Karam S. Chatha
142
Voted
ICMCS
2007
IEEE
131views Multimedia» more  ICMCS 2007»
15 years 11 months ago
3D Model Retrieval Based on Depth Line Descriptor
In this paper, we propose a novel 2D/3D approach for 3D model matching and retrieving. Each model is represented by a set of depth lines which will be afterward transformed into s...
Mohamed Chaouch, Anne Verroust-Blondet