Sciweavers

2260 search results - page 225 / 452
» A new algorithm for clustering search results
Sort
View
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
14 years 2 months ago
Probabilistic models for personalizing web search
We present a new approach for personalizing Web search results to a specific user. Ranking functions for Web search engines are typically trained by machine learning algorithms u...
David Sontag, Kevyn Collins-Thompson, Paul N. Benn...
EVOW
2008
Springer
15 years 8 months ago
Divide, Align and Full-Search for Discovering Conserved Protein Complexes
Advances in modern technologies for measuring protein-protein interaction (PPI) has boosted research in PPI networks analysis and comparison. One of the challenging problems in com...
Pavol Jancura, Jaap Heringa, Elena Marchiori
BMCBI
2011
14 years 10 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
DAWAK
2005
Springer
16 years 3 days ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
FLAIRS
2004
15 years 8 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar