Sciweavers

4047 search results - page 110 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
ICALP
2010
Springer
15 years 9 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
173
Voted
AAAI
2010
15 years 1 months ago
A Cross-Entropy Method that Optimizes Partially Decomposable Problems: A New Way to Interpret NMR Spectra
Some real-world problems are partially decomposable, in that they can be decomposed into a set of coupled subproblems, that are each relatively easy to solve. However, when these ...
Siamak (Moshen) Ravanbakhsh, Barnabás P&oac...
CORR
2008
Springer
216views Education» more  CORR 2008»
15 years 4 months ago
Building an interpretable fuzzy rule base from data using Orthogonal Least Squares Application to a depollution problem
In many fields where human understanding plays a crucial role, such as bioprocesses, the capacity of extracting knowledge from data is of critical importance. Within this framewor...
Sébastien Destercke, Serge Guillaume, Brigi...
FGR
2006
IEEE
134views Biometrics» more  FGR 2006»
15 years 8 months ago
Expanding Training Set for Chinese Sign Language Recognition
In Sign Language recognition, one of the problems is to collect enough training data. Almost all of the statistical methods used in Sign Language Recognition suffer from this prob...
Chunli Wang, Xilin Chen, Wen Gao
ICML
2010
IEEE
15 years 5 months ago
Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is ...
Niranjan Srinivas, Andreas Krause, Sham Kakade, Ma...