Sciweavers

93 search results - page 13 / 19
» Fast and Efficient Total Exchange on Two Clusters
Sort
View
BMCBI
2010
144views more  BMCBI 2010»
14 years 9 months ago
Graph-based clustering and characterization of repetitive sequences in next-generation sequencing data
Background: The investigation of plant genome structure and evolution requires comprehensive characterization of repetitive sequences that make up the majority of higher plant nuc...
Petr Novák, Pavel Neumann, Jirí Maca...
TON
2008
109views more  TON 2008»
14 years 9 months ago
On hierarchical traffic grooming in WDM networks
Abstract--The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any ...
Bensong Chen, George N. Rouskas, Rudra Dutta
77
Voted
ICDCS
2000
IEEE
15 years 2 months ago
Scheduling with Global Information in Distributed Systems
Buffered coscheduling is a distributed scheduling methodology for time-sharing communicating processes in a distributed system, e.g., PC cluster. The principle mechanisms involved...
Fabrizio Petrini, Wu-chun Feng
BMCBI
2010
132views more  BMCBI 2010»
14 years 9 months ago
Protein docking by Rotation-Based Uniform Sampling (RotBUS) with fast computing of intermolecular contact distance and residue d
Background: Protein-protein interactions are fundamental for the majority of cellular processes and their study is of enormous biotechnological and therapeutic interest. In recent...
Albert Solernou, Juan Fernández-Recio
ECCV
2010
Springer
15 years 2 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov