Sciweavers

612 search results - page 79 / 123
» Using Data Compressors to Construct Rank Tests
Sort
View
127
Voted
SIGIR
2004
ACM
15 years 8 months ago
Block-level link analysis
Link Analysis has shown great potential in improving the performance of web search. PageRank and HITS are two of the most popular algorithms. Most of the existing link analysis al...
Deng Cai, Xiaofei He, Ji-Rong Wen, Wei-Ying Ma
SIGSOFT
2007
ACM
16 years 4 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
BMCBI
2007
109views more  BMCBI 2007»
15 years 3 months ago
A domain-based approach to predict protein-protein interactions
Background: Knowing which proteins exist in a certain organism or cell type and how these proteins interact with each other are necessary for the understanding of biological proce...
Mudita Singhal, Haluk Resat
EUROCRYPT
2004
Springer
15 years 8 months ago
Public Key Encryption with Keyword Search
We study the problem of searching on data that is encrypted using a public key system. Consider user Bob who sends email to user Alice encrypted under Alice’s public key. An ema...
Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky...
125
Voted
WABI
2009
Springer
117views Bioinformatics» more  WABI 2009»
15 years 10 months ago
A Simulation Study Comparing Supertree and Combined Analysis Methods Using SMIDGen
Background: Supertree methods comprise one approach to reconstructing large molecular phylogenies given multi-marker datasets: trees are estimated on each marker and then combined...
M. Shel Swenson, François Barbançon,...