Sciweavers

6167 search results - page 52 / 1234
» Can Refinement be Automated
Sort
View
ADCM
2010
100views more  ADCM 2010»
13 years 10 months ago
Quasi-interpolatory refinable functions and construction of biorthogonal wavelet systems
We present a new family of compactly supported and symmetric biorthogonal wavelet systems, which extend and unify the Biorthogonal Coifman wavelet system. The refinement mask has ...
Hong Oh Kim, Rae Young Kim, Yeon Ju Lee, Jungho Yo...
CVPR
2009
IEEE
1132views Computer Vision» more  CVPR 2009»
15 years 5 months ago
Observable Subspaces for 3D Human Motion Recovery
The articulated body models used to represent human motion typically have many degrees of freedom, usually expressed as joint angles that are highly correlated. T...
Andrea Fossati (EPFL), Mathieu Salzmann (Universit...
DAC
2008
ACM
14 years 11 months ago
An integrated nonlinear placement framework with congestion and porosity aware buffer planning
Due to skewed scaling of interconnect delay and cell delay with technology scaling, modern VLSI timing closure requires use of extensive buffer insertion. Inserting a large number...
Tung-Chieh Chen, Ashutosh Chakraborty, David Z. Pa...
DAC
2006
ACM
14 years 11 months ago
Formal analysis of hardware requirements
Formal languages are increasingly used to describe the functional requirements (specifications) of circuits. These requirements are used as a means to communicate design intent an...
Ingo Pill, Simone Semprini, Roberto Cavada, Marco ...
CADE
2007
Springer
14 years 10 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur