Sciweavers

48 search results - page 5 / 10
» Subquadratic Algorithms for 3SUM
Sort
View
PODC
2003
ACM
14 years 1 months ago
Performing work with asynchronous processors: message-delay-sensitive bounds
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
Dariusz R. Kowalski, Alexander A. Shvartsman
ICML
2005
IEEE
14 years 8 months ago
Fast condensed nearest neighbor rule
We present a novel algorithm for computing a training set consistent subset for the nearest neighbor decision rule. The algorithm, called FCNN rule, has some desirable properties....
Fabrizio Angiulli
STACS
2001
Springer
14 years 8 days ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
IPPS
2000
IEEE
14 years 7 days ago
Parallelizability of Some P-Complete Problems
Abstract. In this paper, we consider parallelizability of some Pcomplete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We pr...
Akihiro Fujiwara, Michiko Inoue, Toshimitsu Masuza...
RECOMB
2007
Springer
14 years 8 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