Sciweavers

16404 search results - page 241 / 3281
» A set coverage problem
Sort
View
ICCAD
1993
IEEE
139views Hardware» more  ICCAD 1993»
15 years 8 months ago
Hardware/software resolution of pipeline hazards in pipeline synthesis of instruction set processors
— One major problem in pipeline synthesis is the detection and resolution of pipeline hazards. In this paper we present a new solution to the problem in the domain of pipelined a...
Ing-Jer Huang, Alvin M. Despain
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
LREC
2008
133views Education» more  LREC 2008»
15 years 5 months ago
Comparing Set-Covering Strategies for Optimal Corpus Design
This article is interested in the problem of the linguistic content of a speech corpus. Depending on the target task, the phonological and linguistic content of the corpus is cont...
Jonathan Chevelu, Nelly Barbot, Olivier Boëff...
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...
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
15 years 2 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer