Sciweavers

16430 search results - page 282 / 3286
» On Computable Tree Functions
Sort
View
TPLP
2008
89views more  TPLP 2008»
15 years 4 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...
ECRTS
2002
IEEE
15 years 9 months ago
Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
Antoine Colin, Guillem Bernat
SIROCCO
2004
15 years 6 months ago
Path Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Anat Bremler-Barr, Leah Epstein
ICIP
2002
IEEE
16 years 6 months ago
Unsupervised image segmentation via Markov trees and complex wavelets
The goal in image segmentation is to label pixels in an image based on the properties of each pixel and its surrounding region. Recently Content-Based Image Retrieval (CBIR) has e...
Cián W. Shaffrey, Ian Jermyn, Nick G. Kings...
CODES
2006
IEEE
15 years 10 months ago
The pipeline decomposition tree: : an analysis tool for multiprocessor implementation of image processing applications
Modern embedded systems for image processing involve increasingly complex levels of functionality under real-time and resourcerelated constraints. As this complexity increases, th...
Dong-Ik Ko, Shuvra S. Bhattacharyya