Sciweavers

2740 search results - page 19 / 548
» Approximating Component Selection
Sort
View
93
Voted
MOR
2006
90views more  MOR 2006»
15 years 3 days ago
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani
97
Voted
DATE
1999
IEEE
101views Hardware» more  DATE 1999»
15 years 4 months ago
Polynomial Methods for Allocating Complex Components
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
James Smith, Giovanni De Micheli
JMIV
2002
72views more  JMIV 2002»
14 years 11 months ago
Estimating Overcomplete Independent Component Bases for Image Windows
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...
Aapo Hyvärinen, Mika Inki
JMLR
2010
129views more  JMLR 2010»
14 years 7 months ago
Expectation Truncation and the Benefits of Preselection In Training Generative Models
We show how a preselection of hidden variables can be used to efficiently train generative models with binary hidden variables. The approach is based on Expectation Maximization (...
Jörg Lücke, Julian Eggert
121
Voted
JDCTA
2010
152views more  JDCTA 2010»
14 years 7 months ago
A Semantic Approach to Extract the Final Answer in SBUQA Question Answering System
In this paper we introduce the semantic approach of the answer extraction component of a question answering system called SBUQA. The answer extraction component gets the retrieved...
Mehrnoush Shamsfard, Mahsa Arab Yarmohammadi