Sciweavers

868 search results - page 83 / 174
» A general compression algorithm that supports fast searching
Sort
View
SIGCOMM
2003
ACM
14 years 2 months ago
Making gnutella-like P2P systems scalable
Napster pioneered the idea of peer-to-peer file sharing, and supported it with a centralized file search facility. Subsequent P2P systems like Gnutella adopted decentralized sea...
Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nic...
CEC
2009
IEEE
14 years 3 months ago
A clustering particle swarm optimizer for dynamic optimization
Abstract—In the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal soluti...
Changhe Li, Shengxiang Yang
SIGIR
2008
ACM
13 years 9 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 9 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
SIGIR
2010
ACM
14 years 28 days ago
Discriminative models of integrating document evidence and document-candidate associations for expert search
Generative models such as statistical language modeling have been widely studied in the task of expert search to model the relationship between experts and their expertise indicat...
Yi Fang, Luo Si, Aditya P. Mathur