Sciweavers

418 search results - page 33 / 84
» On the Adders with Minimum Tests
Sort
View
STOC
1992
ACM
110views Algorithms» more  STOC 1992»
13 years 11 months ago
Linear Decision Trees: Volume Estimates and Topological Bounds
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
Anders Björner, László Lov&aacu...
EMNLP
2004
13 years 9 months ago
Unsupervised WSD based on Automatically Retrieved Examples: The Importance of Bias
This paper explores the large-scale acquisition of sense-tagged examples for Word Sense Disambiguation (WSD). We have applied the "WordNet monosemous relatives" method t...
Eneko Agirre, David Martínez
ACL
1998
13 years 9 months ago
Automatic Construction of Frame Representations for Spontaneous Speech in Unrestricted Domains
This paper presents a system which automatically generates shallow semantic frame structures for conversational speech in unrestricted domains. We argue that such shallow semantic...
Klaus Zechner
COMSIS
2006
156views more  COMSIS 2006»
13 years 7 months ago
A Comparison of the Bagging and the Boosting Methods Using the Decision Trees Classifiers
In this paper we present an improvement of the precision of classification algorithm results. Two various approaches are known: bagging and boosting. This paper describes a set of ...
Kristína Machova, Miroslav Puszta, Frantise...
PPPJ
2006
ACM
14 years 1 months ago
The Project Maxwell assembler system
The JavaTM programming language is primarily used for platform-independent programming. Yet it also offers many productivity, maintainability and performance benefits for platfo...
Bernd Mathiske, Douglas N. Simon, Dave Ungar