Sciweavers

8780 search results - page 186 / 1756
» On the Feasibility of Consistent Computations
Sort
View
IPL
2007
78views more  IPL 2007»
15 years 7 months ago
Ensuring the quasi-termination of needed narrowing computations
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
ICASSP
2011
IEEE
14 years 11 months ago
New results on adaptive computational resource allocation in soft MIMO detection
The fundamental problem of our interest is soft MIMO detection for the case of block fading, i.e., when the transmitted codeword spans over several independent channel realization...
Mirsad Cirkic, Daniel Persson, Erik G. Larsson
CIARP
2007
Springer
16 years 1 months ago
Learning in Computer Vision: Some Thoughts
Abstract. It is argued that the ability to generalise is the most important characteristic of learning and that generalisation may be achieved only if pattern recognition systems l...
Maria Petrou
EP
1998
Springer
15 years 11 months ago
Mathematical Tools for Computer-Generated Ornamental Patterns
This article presents mathematical tools for computer-generated ornamental patterns, with a particular attention payed to Islamic patterns. The article shows how, starting from a p...
Victor Ostromoukhov
MOR
2008
83views more  MOR 2008»
15 years 7 months ago
Extensive-Form Correlated Equilibrium: Definition and Computational Complexity
Abstract: This paper defines the extensive form correlated equilibrium (EFCE) for extensive games with perfect recall. The EFCE concept extends Aumann's strategic-form correla...
Bernhard von Stengel, Françoise Forges