Sciweavers

14699 search results - page 417 / 2940
» Complexity and Cognitive Computing
Sort
View
IJCV
2000
110views more  IJCV 2000»
15 years 4 months ago
A Parametric Texture Model Based on Joint Statistics of Complex Wavelet Coefficients
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed ...
Javier Portilla, Eero P. Simoncelli
RAS
2008
109views more  RAS 2008»
15 years 4 months ago
When hard realtime matters: Software for complex mechatronic systems
A still growing number of software concepts and framworks have been proposed to meet the challenges in the development of more and more complex robotic systems, like humanoids or n...
Berthold Bäuml, Gerd Hirzinger
LOGCOM
2010
96views more  LOGCOM 2010»
15 years 3 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis
CORR
2012
Springer
183views Education» more  CORR 2012»
14 years 25 days ago
Twisting q-holonomic sequences by complex roots of unity
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
Stavros Garoufalidis, Christoph Koutschan
ICALP
2009
Springer
16 years 5 months ago
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
Naoki Kobayashi, C.-H. Luke Ong