Sciweavers

3571 search results - page 120 / 715
» Cohen and Set Theory
Sort
View
TIT
2002
65views more  TIT 2002»
13 years 9 months ago
On the importance of combining wavelet-based nonlinear approximation with coding strategies
This paper provides a mathematical analysis of transform compression in its relationship to linear and nonlinear approximation theory. Contrasting linear and nonlinear approximatio...
Albert Cohen, Ingrid Daubechies, Onur G. Guleryuz,...
LPNMR
1999
Springer
14 years 2 months ago
Representing Transition Systems by Logic Programs
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
Vladimir Lifschitz, Hudson Turner
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
14 years 10 months ago
Constructing non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
LPNMR
2009
Springer
14 years 4 months ago
Translating Preferred Answer Set Programs to Propositional Logic
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
Vernon Asuncion, Yan Zhang
CORR
2004
Springer
90views Education» more  CORR 2004»
13 years 10 months ago
Non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky