Sciweavers

526 search results - page 93 / 106
» Efficient Algorithms for Online Decision Problems
Sort
View
74
Voted
DFT
2003
IEEE
64views VLSI» more  DFT 2003»
15 years 2 months ago
Hybrid BIST Time Minimization for Core-Based Systems with STUMPS Architecture
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...
Gert Jervan, Petru Eles, Zebo Peng, Raimund Ubar, ...
IS
2008
14 years 9 months ago
Joining the results of heterogeneous search engines
In recent years, while search engines have become more and more powerful, several specialized search engines have been developed for different domains (e.g. library services, serv...
Daniele Braga, Alessandro Campi, Stefano Ceri, Ale...
90
Voted
EMNLP
2010
14 years 7 months ago
Inducing Probabilistic CCG Grammars from Logical Form with Higher-Order Unification
This paper addresses the problem of learning to map sentences to logical form, given training data consisting of natural language sentences paired with logical representations of ...
Tom Kwiatkowksi, Luke S. Zettlemoyer, Sharon Goldw...
88
Voted
ACL
2009
14 years 7 months ago
Stochastic Gradient Descent Training for L1-regularized Log-linear Models with Cumulative Penalty
Stochastic gradient descent (SGD) uses approximate gradients estimated from subsets of the training data and updates the parameters in an online fashion. This learning framework i...
Yoshimasa Tsuruoka, Jun-ichi Tsujii, Sophia Anania...
WWW
2009
ACM
15 years 10 months ago
idMesh: graph-based disambiguation of linked data
We tackle the problem of disambiguating entities on the Web. We propose a user-driven scheme where graphs of entities ? represented by globally identifiable declarative artifacts ...
Hermann de Meer, Karl Aberer, Michael Jost, Parisa...