Sciweavers

8724 search results - page 240 / 1745
» Search result diversification
Sort
View
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 6 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
SIBGRAPI
2008
IEEE
16 years 1 months ago
Tradeoffs in Approximate Range Searching Made Simpler
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
ICGA
1997
122views Optimization» more  ICGA 1997»
15 years 8 months ago
A Comparison of Global and Local Search Methods in Drug Docking
Molecular docking software makes computational predictions of the interaction of molecules. This can be useful, for example, in evaluating the binding of candidate drug molecules ...
Christopher D. Rosin, R. Scott Halliday, William E...
SAC
2009
ACM
16 years 1 months ago
Diverse peer selection in collaborative web search
Effective peer selection for intelligent query routing is a challenge in collaborative peer-based Web search systems, especially unstructured networks that do not have any central...
Le-Shin Wu, Filippo Menczer
TJS
2008
105views more  TJS 2008»
15 years 6 months ago
Using a relational database for scalable XML search
XML is a flexible and powerful tool that enables information and security sharing in heterogeneous environments. Scalable technologies are needed to effectively manage the growing...
Rebecca Cathey, Steven M. Beitzel, Eric C. Jensen,...