Sciweavers

110 search results - page 7 / 22
» An L-like model containing very large cardinals
Sort
View
ECML
2007
Springer
15 years 3 months ago
Additive Groves of Regression Trees
We present a new regression algorithm called Additive Groves and show empirically that it is superior in performance to a number of other established regression methods. A single G...
Daria Sorokina, Rich Caruana, Mirek Riedewald
ICASSP
2010
IEEE
14 years 4 months ago
Unsupervised knowledge acquisition for Extracting Named Entities from speech
This paper presents a Named Entity Recognition (NER) method dedicated to process speech transcriptions. The main principle behind this method is to collect in an unsupervised way ...
Frédéric Béchet, Eric Charton
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 3 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
ILP
2004
Springer
15 years 2 months ago
On Avoiding Redundancy in Inductive Logic Programming
ILP systems induce first-order clausal theories performing a search through very large hypotheses spaces containing redundant hypotheses. The generation of redundant hypotheses ma...
Nuno A. Fonseca, Vítor Santos Costa, Fernan...
DAC
2008
ACM
15 years 10 months ago
Construction of concrete verification models from C++
C++ based verification methodologies are now emerging as the preferred method for SOC design. However most of the verification involving the C++ models are simulation based. The c...
Malay Haldar, Gagandeep Singh, Saurabh Prabhakar, ...