Sciweavers

6142 search results - page 138 / 1229
» The Complexity of Partition Functions
Sort
View
ISCAS
2007
IEEE
107views Hardware» more  ISCAS 2007»
15 years 4 months ago
Low power variable block size motion estimation using pixel truncation
— This paper presents a method of low-power variable-block-size motion estimation using pixel truncation. Previous work focused on implementing pixel truncation using fixed-bloc...
Asral Bahari, Tughrul Arslan, Ahmet T. Erdogan
ICAS
2006
IEEE
143views Robotics» more  ICAS 2006»
15 years 4 months ago
Towards Autonomic Distribution of Existing Object Oriented Programs
By harnessing computational power of distributed heterogeneous resources, it is possible to build a large scale integrated system so that a centralized program is partitioned and ...
Debzani Deb, M. Muztaba Fuad, Michael J. Oudshoorn
RTA
2009
Springer
15 years 4 months ago
The Derivational Complexity Induced by the Dependency Pair Method
We study the derivational complexity induced by the (basic) dependency pair method. Suppose the derivational complexity induced by a termination method is closed under elementary f...
Georg Moser, Andreas Schnabl
DLT
2008
14 years 11 months ago
Relationally Periodic Sequences and Subword Complexity
By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of...
Julien Cassaigne, Tomi Kärki, Luca Q. Zamboni
TIT
1998
63views more  TIT 1998»
14 years 9 months ago
On the Consistency of Minimum Complexity Nonparametric Estimation
— Nonparametric estimation is usually inconsistent without some form of regularization. One way to impose regularity is through a prior measure. Barron and Cover [1], [2] have sh...
Zhiyi Chi, Stuart Geman