Sciweavers

1805 search results - page 169 / 361
» Functional programming with structured graphs
Sort
View
ICALP
2007
Springer
15 years 7 months ago
Labeling Schemes for Vertex Connectivity
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
Amos Korman
ICCAD
1999
IEEE
99views Hardware» more  ICCAD 1999»
15 years 5 months ago
FunState - an internal design representation for codesign
In this paper, an internal design model called FunState (functions driven by state machines) is presented that enables the representation of different types of system components a...
Lothar Thiele, Karsten Strehl, Dirk Ziegenbein, Ro...
IPPS
1998
IEEE
15 years 5 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
CDC
2009
IEEE
134views Control Systems» more  CDC 2009»
15 years 6 months ago
Event-based control using quadratic approximate value functions
Abstract— In this paper we consider several problems involving control with limited actuation and sampling rates. Event-based control has emerged as an attractive approach for ad...
Randy Cogill
CVPR
2007
IEEE
15 years 7 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...