Sciweavers

1512 search results - page 232 / 303
» Inference Algorithms for Similarity Networks
Sort
View
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 1 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
IJPRAI
2002
93views more  IJPRAI 2002»
14 years 9 months ago
Improving Stability of Decision Trees
Decision-tree algorithms are known to be unstable: small variations in the training set can result in different trees and different predictions for the same validation examples. B...
Mark Last, Oded Maimon, Einat Minkov
IJCNN
2007
IEEE
15 years 4 months ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar
LCN
2007
IEEE
15 years 4 months ago
Efficient Multi-Dimensional Flow Correlation
—Flow correlation algorithms compare flows to determine similarity, and are especially useful and well studied for detecting flow chains through “stepping stone” hosts. Most ...
W. Timothy Strayer, Christine E. Jones, Beverly Sc...
SODA
2004
ACM
107views Algorithms» more  SODA 2004»
14 years 11 months ago
A note on the nearest neighbor in growth-restricted metrics
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish...