Sciweavers

855 search results - page 19 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
15 years 1 months ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal
CGF
2008
122views more  CGF 2008»
14 years 9 months ago
Accurate Shadows by Depth Complexity Sampling
The accurate generation of soft shadows is a particularly computationally intensive task. In order to reduce rendering time, most real-time and offline applications decorrelate th...
Vincent Forest, Loïc Barthe, Mathias Paulin
ICASSP
2009
IEEE
15 years 4 months ago
Robust-SL0 for stable sparse representation in noisy settings
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...
Armin Eftekhari, Massoud Babaie-Zadeh, Christian J...
ICDT
1995
ACM
105views Database» more  ICDT 1995»
15 years 1 months ago
Datalog Queries of Set Constraint Databases
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
Peter Z. Revesz
ECCV
2006
Springer
15 years 11 months ago
Figure/Ground Assignment in Natural Images
Abstract. Figure/ground assignment is a key step in perceptual organization which assigns contours to one of the two abutting regions, providing information about occlusion and all...
Xiaofeng Ren, Charless Fowlkes, Jitendra Malik