Sciweavers

2144 search results - page 78 / 429
» Exact Flow Analysis
Sort
View
ASPDAC
2005
ACM
98views Hardware» more  ASPDAC 2005»
15 years 9 months ago
Bitwidth-aware scheduling and binding in high-level synthesis
- Many high-level description languages, such as C/C++ or Java, lack the capability to specify the bitwidth information for variables and operations. Synthesis from these specifica...
Jason Cong, Yiping Fan, Guoling Han, Yizhou Lin, J...
ICIP
1994
IEEE
16 years 5 months ago
Robust Optical Flow Estimation
Motion information is essential in many computer vision and video analysis tasks. Since MPEG is still one of the most prevalent formats for representing, transferring and storing ...
Sugata Ghosal, Rajiv Mehrotra
JAL
2006
89views more  JAL 2006»
15 years 4 months ago
Improved bounds for the unsplittable flow problem
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
Petr Kolman, Christian Scheideler
POPL
2002
ACM
16 years 4 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
PE
2002
Springer
86views Optimization» more  PE 2002»
15 years 3 months ago
Worst case burstiness increase due to FIFO multiplexing
We consider a FIFO multiplexer fed by flows that are individually constrained by arrival curves, and look for the best possible arrival curve for every output flow. This problem a...
Vicent Cholvi, Juan Echagüe, Jean-Yves Le Bou...