Sciweavers

4926 search results - page 846 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
ESCIENCE
2006
IEEE
14 years 2 months ago
Grid Approach to Embarrassingly Parallel CPU-Intensive Bioinformatics Problems
Bioinformatics algorithms such as sequence alignment methods based on profile-HMM (Hidden Markov Model) are popular but CPU-intensive. If large amounts of data are processed, a s...
Heinz Stockinger, Marco Pagni, Lorenzo Cerutti, La...
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
13 years 9 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
EUROPAR
2010
Springer
13 years 9 months ago
Ants in Parking Lots
Ants provide an attractive metaphor for robots that "cooperate" in performing complex tasks. What, however, are the algorithmic consequences of following this metaphor? ...
Arnold L. Rosenberg
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 9 months ago
An evolutionary approach for competency-based curriculum sequencing
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Sequencing is usually per...
Luis de Marcos, José-Javier Martínez...
TMI
2002
115views more  TMI 2002»
13 years 7 months ago
Discretization of the Radon transform and of its inverse by spline convolutions
Abstract--We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths and degrees . We apply our r...
Stefan Horbelt, Michael Liebling, Michael Unser