3946 search results - page 216 / 790 » The computational complexity of choice sets |
183
click to vote
CIE
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
163
Voted
ESANN
2007
15 years 8 months ago
2007
Abstract. We approach the themes “computing with chaos” and “reservoir computing” in a unified setting. Different neural architectures are mentioned which display chaotic...
171
click to vote
DAC
1998
ACM
15 years 11 months ago
1998
ACM
—Functional simulation is still the primary workhorse for verifying the functional correctness of hardware designs. Functional verification is necessarily incomplete because it i...
193
click to vote
TPDS
2008
15 years 6 months ago
2008
Computational Grids potentially offer low cost, readily available, and large-scale high-performance platforms. For the parallel execution of programs, however, computational GRIDs ...
165
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
This paper presents algorithms for efficiently computing the covariance matrix for features that form sub-windows in a large multidimensional image. For example, several image proc...