Sciweavers

57 search results - page 5 / 12
» On Updating in Very Short Time by Distributed Search Engines
Sort
View
TPDS
2002
112views more  TPDS 2002»
13 years 7 months ago
Performance Analysis of a Distributed Question/Answering System
The problem of question/answering (Q/A) is to find answers to open-domain questions by searching large collections of documents. Unlike information retrieval systems, very common ...
Mihai Surdeanu, Dan I. Moldovan, Sanda M. Harabagi...
BMCBI
2006
111views more  BMCBI 2006»
13 years 7 months ago
High throughput profile-profile based fold recognition for the entire human proteome
Background: In order to maintain the most comprehensive structural annotation databases we must carry out regular updates for each proteome using the latest profile-profile fold r...
Liam J. McGuffin, Richard T. Smith, Kevin Bryson, ...
IRAL
2003
ACM
14 years 19 days ago
Temporal ranking for fresh information retrieval
In business, the retrieval of up-to-date, or fresh, information is very important. It is difficult for conventional search engines based on a centralized architecture to retrieve ...
Nobuyoshi Sato, Minoru Uehara, Yoshifumi Sakai
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
14 years 9 months ago
Improving Transaction-Time DBMS Performance and Functionality
Immortal DB is a transaction time database system that is built into a commercial database system rather than being layered on top. This enables it to have performance that is very...
David B. Lomet, Feifei Li
HPDC
2003
IEEE
14 years 20 days ago
Distributed Pagerank for P2P Systems
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...
Karthikeyan Sankaralingam, Simha Sethumadhavan, Ja...