Sciweavers

21 search results - page 4 / 5
» On lazy randomized incremental construction
Sort
View
SPAA
1990
ACM
13 years 11 months ago
Parallel Algorithms for Arrangements
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
Richard J. Anderson, Paul Beame, Erik Brisson
MA
2010
Springer
140views Communications» more  MA 2010»
13 years 5 months ago
On the limiting spectral distribution of the covariance matrices of time-lagged processes
We consider two continuous-time Gaussian processes, one being partially correlated to a time-lagged version of the other. We first give the limiting spectral distribution for the ...
Christian Y. Robert, Mathieu Rosenbaum
JISE
2010
144views more  JISE 2010»
13 years 2 months ago
Variant Methods of Reduced Set Selection for Reduced Support Vector Machines
In dealing with large datasets the reduced support vector machine (RSVM) was proposed for the practical objective to overcome the computational difficulties as well as to reduce t...
Li-Jen Chien, Chien-Chung Chang, Yuh-Jye Lee
BMCBI
2010
198views more  BMCBI 2010»
13 years 7 months ago
ClustalXeed: a GUI-based grid computation version for high performance and terabyte size multiple sequence alignment
Background: There is an increasing demand to assemble and align large-scale biological sequence data sets. The commonly used multiple sequence alignment programs are still limited...
Taeho Kim, Hyun Joo
RAS
2006
123views more  RAS 2006»
13 years 7 months ago
Planning exploration strategies for simultaneous localization and mapping
In this paper, we present techniques that allow one or multiple mobile robots to efficiently explore and model their environment. While much existing research in the area of Simul...
Benjamín Tovar, Lourdes Muñoz-G&oacu...