Sciweavers

1091 search results - page 180 / 219
» Visibility-based feature extraction from discrete models
Sort
View
SIGIR
2011
ACM
14 years 4 months ago
Pseudo test collections for learning web search ranking functions
Test collections are the primary drivers of progress in information retrieval. They provide a yardstick for assessing the effectiveness of ranking functions in an automatic, rapi...
Nima Asadi, Donald Metzler, Tamer Elsayed, Jimmy L...
CEC
2010
IEEE
15 years 3 months ago
Local Optima Networks of the Quadratic Assignment Problem
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob...
Fabio Daolio, Sébastien Vérel, Gabri...
BMCBI
2004
135views more  BMCBI 2004»
15 years 1 months ago
Information assessment on predicting protein-protein interactions
Background: Identifying protein-protein interactions is fundamental for understanding the molecular machinery of the cell. Proteome-wide studies of protein-protein interactions ar...
Nan Lin, Baolin Wu, Ronald Jansen, Mark Gerstein, ...
PKDD
2004
Springer
205views Data Mining» more  PKDD 2004»
15 years 7 months ago
Breaking Through the Syntax Barrier: Searching with Entities and Relations
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
Soumen Chakrabarti
EUROCRYPT
1999
Springer
15 years 6 months ago
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
Pascal Paillier