Sciweavers

5153 search results - page 109 / 1031
» Introduction to Randomized Algorithms
Sort
View
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
16 years 2 months ago
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
Stephen D. Bay, Mark Schwabacher
143
Voted
MCS
2007
Springer
15 years 8 months ago
Random Feature Subset Selection for Ensemble Based Classification of Data with Missing Features
Abstract. We report on our recent progress in developing an ensemble of classifiers based algorithm for addressing the missing feature problem. Inspired in part by the random subsp...
Joseph DePasquale, Robi Polikar
CAL
2008
15 years 2 months ago
Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks
Abstract-- This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized PartiallyMinimal (RPM) routing that provably achieves optimal worstcase thr...
Rohit Sunkam Ramanujam, Bill Lin
ISCA
2003
IEEE
130views Hardware» more  ISCA 2003»
15 years 7 months ago
GOAL: A Load-Balanced Adaptive Routing Algorithm for Torus Networks
We introduce a load-balanced adaptive routing algorithm for torus networks, GOAL - Globally Oblivious Adaptive Locally - that provides high throughput on adversarial traffic patt...
Arjun Singh, William J. Dally, Amit K. Gupta, Bria...
114
Voted
EUROCRYPT
2001
Springer
15 years 7 months ago
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
Mireille Fouquet, Pierrick Gaudry, Robert Harley