Sciweavers

2778 search results - page 263 / 556
» Limit complexities revisited
Sort
View
COMPUTER
2002
129views more  COMPUTER 2002»
15 years 6 months ago
Networks on Chips: A New SoC Paradigm
of abstraction and coarse granularity and distributed communication control. Focusing on using probabilistic metrics such as average values or variance to quantify design objective...
Luca Benini, Giovanni De Micheli
ML
2000
ACM
103views Machine Learning» more  ML 2000»
15 years 6 months ago
Phase Transitions in Relational Learning
One of the major limitations of relational learning is due to the complexity of verifying hypotheses on examples. In this paper we investigate this task in light of recent publishe...
Attilio Giordana, Lorenza Saitta
AROBOTS
1999
87views more  AROBOTS 1999»
15 years 6 months ago
Dynamics of a Classical Conditioning Model
Abstract. Classical conditioning is a basic learning mechanism in animals and can be found in almost all organisms. If we want to construct robots with abilities matching those of ...
Christian Balkenius
TOG
2002
105views more  TOG 2002»
15 years 6 months ago
Painting and rendering textures on unparameterized models
This paper presents a solution for texture mapping unparameterized models. The quality of a texture on a model is often limited by the model's parameterization into a 2D text...
David (grue) DeBry, Jonathan Gibbs, Devorah DeLeon...
MICS
2007
57views more  MICS 2007»
15 years 6 months ago
Pseudozero Set of Real Multivariate Polynomials
The pseudozero set of a system P of polynomials in n variables is the subset of Cn consisting of the union of the zeros of all polynomial systems Q that are near to P in a suitable...
Stef Graillat