Sciweavers

91 search results - page 6 / 19
» Some Improvements for the Fast Sweeping Method
Sort
View
BMCBI
2010
122views more  BMCBI 2010»
13 years 7 months ago
Fast and accurate protein substructure searching with simulated annealing and GPUs
Background: Searching a database of protein structures for matches to a query structure, or occurrences of a structural motif, is an important task in structural biology and bioin...
Alex Stivala, Peter J. Stuckey, Anthony Wirth
BMCBI
2007
138views more  BMCBI 2007»
13 years 7 months ago
Fast computation of distance estimators
Background: Some distance methods are among the most commonly used methods for reconstructing phylogenetic trees from sequence data. The input to a distance method is a distance m...
Isaac Elias, Jens Lagergren
SYRCODIS
2008
104views Database» more  SYRCODIS 2008»
13 years 9 months ago
Search Request Routing in Bittorrent and other P2P based File Sharing Networks
Existing p2p file sharing networks doesn't always give their users abilities to make an effective and fast searches for particular data. In this paper we introduce some impro...
Konstantin Scherbakov
VCIP
2003
183views Communications» more  VCIP 2003»
13 years 8 months ago
Fast motion estimation and mode decision with variable motion block sizes
The adaptive coding schemes in H.264 standard provide a significant coding efficiency and some additional features like error resilience and network friendliness. The variable blo...
Woong Il Choi, Jeyun Lee, Sungmo Yang, Byeungwoo J...
CVPR
2008
IEEE
14 years 1 months ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie