Sciweavers

5 search results - page 1 / 1
» Partial read from peer-to-peer databases
Sort
View
COMCOM
2008
70views more  COMCOM 2008»
13 years 4 months ago
Partial read from peer-to-peer databases
Farnoush Banaei Kashani, Cyrus Shahabi
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
14 years 5 months ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...
ICDE
2010
IEEE
171views Database» more  ICDE 2010»
14 years 4 months ago
Surrogate Ranking for Very Expensive Similarity Queries
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...
BMCBI
2008
102views more  BMCBI 2008»
13 years 4 months ago
Ornithine decarboxylase antizyme finder (OAF): Fast and reliable detection of antizymes with frameshifts in mRNAs
Background: Ornithine decarboxylase antizymes are proteins which negatively regulate cellular polyamine levels via their affects on polyamine synthesis and cellular uptake. In vir...
Michaël Bekaert, Ivaylo P. Ivanov, John F. At...
AAAI
2008
13 years 7 months ago
Existentially Quantified Values for Queries and Updates of Facts in Transaction Logic Programs
In several applications of logic programming and Transaction Logic, such as, planning, trust management and independent Semantic Web Services, an action might produce incomplete f...
Paul Fodor