Sciweavers

2570 search results - page 373 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
153
Voted
ISCAPDCS
2003
15 years 4 months ago
Design and Analysis of Improved Shortest Path Tree Update for Network Routing
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
Bin Xiao, Qingfeng Zhuge, Zili Shao, Edwin Hsing-M...
RECSYS
2010
ACM
15 years 3 months ago
Incremental collaborative filtering via evolutionary co-clustering
Collaborative filtering is a popular approach for building recommender systems. Current collaborative filtering algorithms are accurate but also computationally expensive, and so ...
Mohammad Khoshneshin, W. Nick Street
105
Voted
IVC
2006
97views more  IVC 2006»
15 years 3 months ago
Dominant colour extraction in DCT domain
As most of MPEG and JPEG compression standards are DCT-based, we propose a simple, low-cost and fast algorithm to extract dominant colour features directly in DCT domain without i...
Jianmin Jiang, Ying Weng, Pengjie Li
158
Voted
SCALESPACE
2007
Springer
15 years 9 months ago
Non-negative Sparse Modeling of Textures
This paper presents a statistical model for textures that uses a non-negative decomposition on a set of local atoms learned from an exemplar. This model is described by the varianc...
Gabriel Peyré
BMCBI
2008
220views more  BMCBI 2008»
15 years 3 months ago
Gene prediction in metagenomic fragments: A large scale machine learning approach
Background: Metagenomics is an approach to the characterization of microbial genomes via the direct isolation of genomic sequences from the environment without prior cultivation. ...
Katharina J. Hoff, Maike Tech, Thomas Lingner, Rol...