Sciweavers

12148 search results - page 2147 / 2430
» Generalized Bundle Methods
Sort
View
157
Voted
DAM
1999
100views more  DAM 1999»
15 years 3 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
ML
2002
ACM
167views Machine Learning» more  ML 2002»
15 years 3 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
NN
1998
Springer
177views Neural Networks» more  NN 1998»
15 years 3 months ago
Soft vector quantization and the EM algorithm
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
Ethem Alpaydin
SIGIR
2002
ACM
15 years 3 months ago
Document clustering with cluster refinement and model selection capabilities
In this paper, we propose a document clustering method that strives to achieve: (1) a high accuracy of document clustering, and (2) the capability of estimating the number of clus...
Xin Liu, Yihong Gong, Wei Xu, Shenghuo Zhu
TSE
1998
129views more  TSE 1998»
15 years 3 months ago
Inferring Declarative Requirements Specifications from Operational Scenarios
—Scenarios are increasingly recognized as an effective means for eliciting, validating, and documenting software requirements. This paper concentrates on the use of scenarios for...
Axel van Lamsweerde, Laurent Willemet
« Prev « First page 2147 / 2430 Last » Next »