Sciweavers

29908 search results - page 253 / 5982
» On the Complexity of
Sort
View
TCSV
2002
88views more  TCSV 2002»
15 years 6 months ago
Variable complexity DCT approximations driven by an HVQ-based analyzer
Transform approximations are explored for speeding up the software compression of images and video. Approximations are used to replace the regular discrete cosine transform (DCT) w...
Ricardo L. de Queiroz
RAS
2008
109views more  RAS 2008»
15 years 6 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
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 5 months ago
Strong direct product theorems for quantum communication and query complexity
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
Alexander A. Sherstov
FSS
2010
111views more  FSS 2010»
15 years 5 months ago
The geometry of consonant belief functions: Simplicial complexes of necessity measures
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...
Fabio Cuzzolin
JUCS
2010
129views more  JUCS 2010»
15 years 5 months ago
Orthogonal Concatenation: Language Equations and State Complexity
: A language L is the orthogonal concatenation of languages L1 and L2 if every word of L can be written in a unique way as a concatenation of a word in L1 and a word in L2. The not...
Mark Daley, Michael Domaratzki, Kai Salomaa