Sciweavers

4110 search results - page 634 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
ATAL
2006
Springer
15 years 10 months ago
Distributed navigation in an unknown physical environment
We address the problem of navigating from an initial node to a goal node by a group of agents in an unknown physical environment. In such environments mobile agents must physicall...
Arnon Gilboa, Amnon Meisels, Ariel Felner
RECSYS
2010
ACM
15 years 6 months ago
Affiliation recommendation using auxiliary networks
Social network analysis has attracted increasing attention in recent years. In many social networks, besides friendship links amongst users, the phenomenon of users associating th...
Vishvas Vasuki, Nagarajan Natarajan, Zhengdong Lu,...
BMCBI
2010
157views more  BMCBI 2010»
15 years 6 months ago
SeqTrim: a high-throughput pipeline for pre-processing any type of sequence read
Background: High-throughput automated sequencing has enabled an exponential growth rate of sequencing data. This requires increasing sequence quality and reliability in order to a...
Juan Falgueras, Antonio J. Lara, Noé Fern&a...
BMCBI
2010
151views more  BMCBI 2010»
15 years 6 months ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon
IJAC
2006
93views more  IJAC 2006»
15 years 6 months ago
On Word Reversing in Braid Groups
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a...
Patrick Dehornoy, Bert Wiest