Sciweavers

620 search results - page 9 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
RECOMB
2007
Springer
15 years 9 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
LWA
2004
14 years 11 months ago
A Simple Method For Estimating Conditional Probabilities For SVMs
Support Vector Machines (SVMs) have become a popular learning algorithm, in particular for large, high-dimensional classification problems. SVMs have been shown to give most accur...
Stefan Rüping
70
Voted
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
15 years 1 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale
ICML
2003
IEEE
15 years 10 months ago
SimpleSVM
We present a fast iterative support vector training algorithm for a large variety of different formulations. It works by incrementally changing a candidate support vector set usin...
S. V. N. Vishwanathan, Alex J. Smola, M. Narasimha...
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
15 years 10 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