Sciweavers

1013 search results - page 196 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
DAGSTUHL
2007
13 years 10 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Bodo Manthey, Till Tantau
BMCBI
2007
153views more  BMCBI 2007»
13 years 9 months ago
An exploration of alternative visualisations of the basic helix-loop-helix protein interaction network
Background: Alternative representations of biochemical networks emphasise different aspects of the data and contribute to the understanding of complex biological systems. In this ...
Brian J. Holden, John W. Pinney, Simon C. Lovell, ...
MM
2006
ACM
108views Multimedia» more  MM 2006»
14 years 2 months ago
Video search reranking via information bottleneck principle
We propose a novel and generic video/image reranking algorithm, IB reranking, which reorders results from text-only searches by discovering the salient visual patterns of relevant...
Winston H. Hsu, Lyndon S. Kennedy, Shih-Fu Chang
CP
2003
Springer
14 years 2 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
KDD
2009
ACM
232views Data Mining» more  KDD 2009»
14 years 1 months ago
Probabilistic latent semantic user segmentation for behavioral targeted advertising
Behavioral Targeting (BT), which aims to deliver the most appropriate advertisements to the most appropriate users, is attracting much attention in online advertising market. A ke...
Xiaohui Wu, Jun Yan, Ning Liu, Shuicheng Yan, Ying...