Sciweavers

15033 search results - page 16 / 3007
» Complexity Theory and Algorithms
Sort
View
JC
2006
105views more  JC 2006»
14 years 9 months ago
On the complexity of the resolvent representation of some prime differential ideals
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solern&oa...
TIP
2010
111views more  TIP 2010»
14 years 4 months ago
Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a classical demosaicking algorithm based on alternating projections (AP), propos...
Yue M. Lu, Mina Karzand, Martin Vetterli
COMPGEOM
2010
ACM
15 years 2 months ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
15 years 7 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
CORR
2008
Springer
115views Education» more  CORR 2008»
14 years 9 months ago
Kolmogorov complexity in perspective
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
Marie Ferbus-Zanda, Serge Grigorieff