Sciweavers

2226 search results - page 290 / 446
» Computable Analysis via Representations
Sort
View
TLCA
2005
Springer
16 years 1 days ago
The Elimination of Nesting in SPCF
We use a fully abstract denotational model to show that nested function calls and recursive definitions can be eliminated from SPCF (a typed functional language with simple non-lo...
James Laird
CVPR
2010
IEEE
15 years 11 months ago
An Online Approach: Learning-Semantic-Scene-by-Tracking and Tracking-by-Learning-Semantic-Scene
Learning the knowledge of scene structure and tracking a large number of targets are both active topics of computer vision in recent years, which plays a crucial role in surveilla...
Xuan Song, Xiaowei Shao, Huijing Zhao, Jinshi Cui,...
SCALESPACE
2001
Springer
15 years 11 months ago
Down-Scaling for Better Transform Compression
Abstract. The most popular lossy image compression method used on the Internet is the JPEG standard. JPEG’s good compression performance and low computational and memory complexi...
Alfred M. Bruckstein, Michael Elad, Ron Kimmel
JSA
2010
101views more  JSA 2010»
15 years 5 months ago
Experimental evaluation of slack management in real-time control systems: Coordinated vs. self-triggered approach
Effective slack management, i.e. management of unused computing resources, for real-time control tasks mandates to redistribute the available resources between controllers as a f...
Manel Velasco, Pau Martí, Josep M. Fuertes,...
DAC
2006
ACM
16 years 7 months ago
Early cutpoint insertion for high-level software vs. RTL formal combinational equivalence verification
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
Xiushan Feng, Alan J. Hu