Sciweavers

925 search results - page 141 / 185
» Connectivity on Complete Lattices
Sort
View
AAAI
1998
13 years 8 months ago
Boosting in the Limit: Maximizing the Margin of Learned Ensembles
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
Adam J. Grove, Dale Schuurmans
ACL
1998
13 years 8 months ago
How Verb Subcategorization Frequencies Are Affected By Corpus Choice
The probabilistic relation between verbs and their arguments plays an important role in modern statistical parsers and supertaggers, and in psychological theories of language proc...
Douglas Roland, Daniel Jurafsky
MASCOTS
1998
13 years 8 months ago
Performance Analysis of Cellular Mobile Communication Networks Supporting Multimedia Services
This paper illustrates the development of an approximate analytical model for a communication network providing integrated services to a population of mobile users, and presents p...
Marco Ajmone Marsan, Salvatore Marano, Carlo Mastr...
SODA
2000
ACM
96views Algorithms» more  SODA 2000»
13 years 8 months ago
Improved Steiner tree approximation in graphs
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
Gabriel Robins, Alexander Zelikovsky
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
13 years 8 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...