Sciweavers

544 search results - page 92 / 109
» On the Complexity of Loop Fusion
Sort
View
ICSOC
2010
Springer
13 years 5 months ago
Automatic Fragment Identification in Workflows Based on Sharing Analysis
In Service-Oriented Computing (SOC), fragmentation and merging of workflows are motivated by a number of concerns, among which we can cite design issues, performance, and privacy. ...
Dragan Ivanovic, Manuel Carro, Manuel V. Hermenegi...
TCS
2010
13 years 2 months ago
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
Samuel Alexandre Vidal
CVPR
2012
IEEE
11 years 10 months ago
Real-time scene text localization and recognition
An end-to-end real-time scene text localization and recognition method is presented. The real-time performance is achieved by posing the character detection problem as an efficie...
Lukas Neumann, Jiri Matas
DAC
2012
ACM
11 years 10 months ago
Equivalence checking for behaviorally synthesized pipelines
Loop pipelining is a critical transformation in behavioral synthesis. It is crucial to producing hardware designs with acceptable latency and throughput. However, it is a complex ...
Kecheng Hao, Sandip Ray, Fei Xie
IQ
2001
13 years 9 months ago
Information Envelope and its Information Integrity Implications
: Physical and informational works are strongly interrelated in a business process. This facilitates modeling a business process as an integral part of a closed loop information an...
Vijay V. Mandke, Madhavan K. Nayar, Kamna Malik