Sciweavers

1702 search results - page 301 / 341
» Using Nondeterminism to Design Efficient Deterministic Algor...
Sort
View
182
Voted
BMCBI
2011
14 years 6 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
142
Voted
WWW
2006
ACM
16 years 3 months ago
Large-scale text categorization by batch mode active learning
Large-scale text categorization is an important research topic for Web data mining. One of the challenges in large-scale text categorization is how to reduce the amount of human e...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu
CASES
2010
ACM
15 years 16 days ago
Improved procedure placement for set associative caches
The performance of most embedded systems is critically dependent on the memory hierarchy performance. In particular, higher cache hit rate can provide significant performance boos...
Yun Liang, Tulika Mitra
116
Voted
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
16 years 2 months ago
A framework for ontology-driven subspace clustering
Traditional clustering is a descriptive task that seeks to identify homogeneous groups of objects based on the values of their attributes. While domain knowledge is always the bes...
Jinze Liu, Wei Wang 0010, Jiong Yang
119
Voted
ICCV
2009
IEEE
16 years 7 months ago
Heterogeneous Feature Machines for Visual Recognition
With the recent efforts made by computer vision researchers, more and more types of features have been designed to describe various aspects of visual characteristics. Modeling s...
Liangliang Cao, Jiebo Luo, Feng Liang, Thomas S. H...