Sciweavers

2988 search results - page 371 / 598
» Experiments with a New Boosting Algorithm
Sort
View
INFOCOM
1999
IEEE
15 years 7 months ago
Inter-Class Resource Sharing using Statistical Service Envelopes
Networks that support multiple services through "link-sharing" must address the fundamental conflicting requirement between isolation among service classes to satisfy ea...
Jingyu Qiu, Edward W. Knightly
DAWAK
1999
Springer
15 years 7 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
GECCO
2006
Springer
128views Optimization» more  GECCO 2006»
15 years 6 months ago
FTXI: fault tolerance XCS in integer
In the realm of data mining, several key issues exists in the traditional classification algorithms, such as low readability, large rule number, and low accuracy with information ...
Hong-Wei Chen, Ying-Ping Chen
MICCAI
2000
Springer
15 years 6 months ago
Efficient Semiautomatic Segmentation of 3D Objects in Medical Images
Abstract. We present a fast and accurate tool for semiautomatic segmentation of volumetric medical images based on the live wire algorithm, shape-based interpolation and a new opti...
Andrea Schenk, Guido P. M. Prause, Heinz-Otto Peit...
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
15 years 5 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa