Sciweavers

2863 search results - page 397 / 573
» Constructing minimum-interference networks
Sort
View
107
Voted
ICML
2002
IEEE
16 years 4 months ago
Exact model averaging with naive Bayesian classifiers
The naive classifier is a well-established mathematical model whose simplicity, speed and accuracy have made it a popular choice for classification in AI and engineering. In this ...
Denver Dash, Gregory F. Cooper
123
Voted
KDD
2002
ACM
157views Data Mining» more  KDD 2002»
16 years 3 months ago
Exploiting unlabeled data in ensemble methods
An adaptive semi-supervised ensemble method, ASSEMBLE, is proposed that constructs classification ensembles based on both labeled and unlabeled data. ASSEMBLE alternates between a...
Kristin P. Bennett, Ayhan Demiriz, Richard Maclin
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 3 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
16 years 3 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
15 years 10 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl