Sciweavers

143 search results - page 14 / 29
» How to rank with few errors
Sort
View
IPM
2007
156views more  IPM 2007»
14 years 11 months ago
p2pDating: Real life inspired semantic overlay networks for Web search
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independe...
Josiane Xavier Parreira, Sebastian Michel, Gerhard...
DEBU
1998
95views more  DEBU 1998»
14 years 11 months ago
What can you do with a Web in your Pocket?
The amount of information available online has grown enormously over the past decade. Fortunately, computing power, disk capacity, and network bandwidth have also increased dramat...
Sergey Brin, Rajeev Motwani, Lawrence Page, Terry ...
BMCBI
2008
95views more  BMCBI 2008»
14 years 12 months ago
Gene set analyses for interpreting microarray experiments on prokaryotic organisms
Background: Despite the widespread usage of DNA microarrays, questions remain about how best to interpret the wealth of gene-by-gene transcriptional levels that they measure. Rece...
Nathan L. Tintle, Aaron A. Best, Matthew DeJongh, ...
CSDA
2007
79views more  CSDA 2007»
14 years 11 months ago
Modelling series of studies with a common structure
Consider the situation where the Structuration des Tableaux à Trois Indices de la Statistique (STATIS) methodology is applied to a series of studies, each study being represented...
Manuela M. Oliveira, João Mexia
DCC
2005
IEEE
15 years 11 months ago
Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults
Elliptic curve cryptosystems in the presence of faults were studied by Biehl, Meyer and M?uller (2000). The first fault model they consider requires that the input point P in the c...
Mathieu Ciet, Marc Joye