10054 search results - page 221 / 2011 » On the Complexity of Function Learning |
132
click to vote
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
97
Voted
IVA
2005
Springer
15 years 6 months ago
2005
Springer
An important characteristic of a virtual human is the ability to direct its perceptual attention to entities and areas in a virtual environment in a manner that appears believable ...
93
Voted
JC
2002
15 years 15 days ago
2002
Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a fun...
DATE
2002
IEEE
15 years 5 months ago
2002
IEEE
In this paper, we analyze the use of UML as a starting point to go from design issues to end of production testing of complex embedded systems. The first point is the analysis of ...
PRL
2000
15 years 18 days ago
2000
The need to