Sciweavers

1017 search results - page 42 / 204
» Register computations on ordinals
Sort
View
IJES
2007
79views more  IJES 2007»
13 years 7 months ago
Energy-aware compilation and hardware design for VLIW embedded systems
Abstract: Tomorrow’s embedded devices need to run high-resolution multimedia applications which need an enormous computational complexity with a very low energy consumption const...
José L. Ayala, Marisa López-Vallejo,...
CASES
2009
ACM
13 years 5 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
CIA
2006
Springer
13 years 11 months ago
The Distortion of Cardinal Preferences in Voting
The theoretical guarantees provided by voting have distinguished it as a prominent method of preference aggregation among autonomous agents. However, unlike humans, agents usually ...
Ariel D. Procaccia, Jeffrey S. Rosenschein
CSDA
2007
123views more  CSDA 2007»
13 years 7 months ago
Bayesian estimation of unrestricted and order-restricted association models for a two-way contingency table
In two-way contingency tables analysis, a popular class of models for describing the structure of the association between the two categorical variables are the so-called “associ...
G. Iliopoulos, Maria Kateri, Ioannis Ntzoufras
CVPR
2008
IEEE
14 years 9 months ago
Order consistent change detection via fast statistical significance testing
Robustness to illumination variations is a key requirement for the problem of change detection which in turn is a fundamental building block for many visual surveillance applicati...
Maneesh Singh, Vasu Parameswaran, Visvanathan Rame...