Sciweavers

1187 search results - page 137 / 238
» The Generalized Dimensionality Reduction Problem
Sort
View
MOC
2002
118views more  MOC 2002»
14 years 9 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
ICMI
2007
Springer
160views Biometrics» more  ICMI 2007»
15 years 4 months ago
Using the influence model to recognize functional roles in meetings
In this paper, an influence model is used to recognize functional roles played during meetings. Previous works on the same corpus demonstrated a high recognition accuracy using SV...
Wen Dong, Bruno Lepri, Alessandro Cappelletti, Ale...
MFCS
2007
Springer
15 years 4 months ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner
FSTTCS
1994
Springer
15 years 1 months ago
On the Interactive Complexity of Graph Reliability
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
Jean Marc Couveignes, Juan Francisco Diaz-Frias, M...
SBRN
2008
IEEE
15 years 4 months ago
Imitation Learning of an Intelligent Navigation System for Mobile Robots Using Reservoir Computing
The design of an autonomous navigation system for mobile robots can be a tough task. Noisy sensors, unstructured environments and unpredictability are among the problems which mus...
Eric A. Antonelo, Benjamin Schrauwen, Dirk Strooba...