Sciweavers

14699 search results - page 402 / 2940
» Complexity and Cognitive Computing
Sort
View
PR
2008
90views more  PR 2008»
15 years 5 months ago
Fast computation of geometric moments using a symmetric kernel
This paper presents a novel set of geometric moments with symmetric kernel (SGM) obtained using an appropriate transformation of image coordinates. By using this image transformat...
Chong-Yaw Wee, Paramesran Raveendran, R. Mukundan
ACMIDC
2010
15 years 9 months ago
BeeSim: leveraging wearable computers in participatory simulations with young children
New technologies have enabled students to become active participants in computational simulations of dynamic and complex systems (called Participatory Simulations), providing a &q...
Kylie A. Peppler, Joshua A. Danish, Benjamin Zaitl...
ICIP
2008
IEEE
16 years 6 months ago
Complexity modeling of H.264 entropy decoding
This paper models the complexity consumption of entropy decoding in a H.264 decoder, which includes many modes such as fix-length code (FLC), variable-length code (ExpGolomb code ...
Zhan Ma, Zhongbo Zhang, Yao Wang
ISLPED
1996
ACM
102views Hardware» more  ISLPED 1996»
15 years 9 months ago
High-level power estimation and the area complexity of Boolean functions
Estimation of the area complexity of a Boolean function from its functional description is an important step towards a power estimation capability at the register transfer level (...
Mahadevamurty Nemani, Farid N. Najm
153
Voted
CORR
2007
Springer
169views Education» more  CORR 2007»
15 years 5 months ago
Algorithmic Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...