Sciweavers

45 search results - page 9 / 9
» Dynamic similarity search in multi-metric spaces
Sort
View
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
13 years 10 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
ATAL
2003
Springer
13 years 10 months ago
Cooperative negotiation for soft real-time distributed resource allocation
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
Roger Mailler, Victor R. Lesser, Bryan Horling
WWW
2009
ACM
14 years 5 months ago
Efficient overlap and content reuse detection in blogs and online news articles
The use of blogs to track and comment on real world (political, news, entertainment) events is growing. Similarly, as more individuals start relying on the Web as their primary in...
Jong Wook Kim, Jun'ichi Tatemura, K. Selçuk...
WWW
2009
ACM
14 years 5 months ago
Matchbox: large scale online bayesian recommendations
We present a probabilistic model for generating personalised recommendations of items to users of a web service. The Matchbox system makes use of content information in the form o...
David H. Stern, Ralf Herbrich, Thore Graepel
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 5 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer