Sciweavers

620 search results - page 72 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
ARITH
2005
IEEE
15 years 5 months ago
N-Bit Unsigned Division via N-Bit Multiply-Add
Integer division on modern processors is expensive compared to multiplication. Previous algorithms for performing unsigned division by an invariant divisor, via reciprocal approxi...
Arch D. Robison
ADMA
2005
Springer
149views Data Mining» more  ADMA 2005»
15 years 5 months ago
A New Support Vector Machine for Data Mining
Abstract. This paper proposes a new support vector machine (SVM) with a robust loss function for data mining. Its dual optimal formation is also constructed. A gradient based algor...
Haoran Zhang, Xiaodong Wang, Changjiang Zhang, Xiu...
ICCS
2005
Springer
15 years 5 months ago
MC Slicing for Volume Rendering Applications
Recent developments in volume visualization using standard graphics hardware provide an effective and interactive way to understand and interpret the data. Mainly based on 3d text...
A. Benassarou, Eric Bittar, N. W. John, Laurent Lu...
WEA
2005
Springer
117views Algorithms» more  WEA 2005»
15 years 5 months ago
Vertex Cover Approximations: Experiments and Observations
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
Eyjolfur Asgeirsson, Clifford Stein
ICA
2004
Springer
15 years 5 months ago
Blind Deconvolution of SISO Systems with Binary Source Based on Recursive Channel Shortening
We treat the problem of Blind Deconvolution of Single Input - Single Output (SISO) systems with real or complex binary sources. We explicate the basic mathematical idea by focusing...
Konstantinos I. Diamantaras, Theophilos Papadimitr...