Sciweavers

828 search results - page 91 / 166
» Simplicial Powers of Graphs
Sort
View
CIE
2009
Springer
13 years 11 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch
DASC
2006
IEEE
13 years 11 months ago
Automated Caching of Behavioral Patterns for Efficient Run-Time Monitoring
Run-time monitoring is a powerful approach for dynamically detecting faults or malicious activity of software systems. However, there are often two obstacles to the implementation...
Natalia Stakhanova, Samik Basu, Robyn R. Lutz, Joh...
DAC
1995
ACM
13 years 11 months ago
Rephasing: A Transformation Technique for the Manipulation of Timing Constraints
- We introduce a transformation, named rephasing, that manipulates the timing parameters in control-dataflow graphs. Traditionally high-level synthesis systems for DSP have either ...
Miodrag Potkonjak, Mani B. Srivastava
ACII
2005
Springer
13 years 9 months ago
The Bunch-Active Shape Model
Active Shape Model (ASM) is one of the most powerful statistical tools for face image alignment. In this paper, we propose a novel method, called Bunch-Active Shape Model (Bunch-AS...
Jingcai Fan, Hongxun Yao, Wen Gao, Yazhou Liu, Xin...
ESWS
2008
Springer
13 years 9 months ago
Previewing Semantic Web Pipes
In this demo we present a first implementation of Semantic Web Pipes, a powerful tool to build RDF-based mashups. Semantic Web pipes are defined in XML and when executed they fetch...
Christian Morbidoni, Danh Le Phuoc, Axel Polleres,...