2168 search results - page 85 / 434 » Randomized Algorithms and Complexity Theory |
146
click to vote
IEEEPACT
1997
IEEE
15 years 7 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
134
click to vote
AOSD
2007
ACM
15 years 7 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
102
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
121
click to vote
COMPGEOM
2008
ACM
15 years 4 months ago
2008
ACM
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...
119
click to vote
CORR
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...