1399 search results - page 120 / 280 » Multi-party Finite Computations |
157
click to vote
LICS
2010
IEEE
15 years 1 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
140
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
In this work we propose a model for video scenes that contain temporal variability in shape and appearance. We propose a conditionally linear model akin to a dynamic extension of ...
117
click to vote
ICPP
2009
IEEE
15 years 10 months ago
2009
IEEE
—This paper reports a study of mapping the Finite Difference Time Domain (FDTD) application to the IBM Cyclops64 (C64) many-core chip architecture [1]. C64 is chosen for this stu...
109
click to vote
IHM
2004
ACM
15 years 9 months ago
2004
ACM
Although coupling interaction resources is key to ubiquitous computing, this notion has been overlooked in previous studies. In this paper, we address this notion in a more system...
119
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
We present a method for transforming the infinite interactive state space of interactive POMDPs (I-POMDPs) into a finite one, thereby enabling the computation of exact solutions. ...