Sciweavers

229 search results - page 44 / 46
» How Efficient Can Memory Checking Be
Sort
View
SIGMOD
2009
ACM
220views Database» more  SIGMOD 2009»
14 years 7 months ago
Keyword search in databases: the power of RDBMS
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
Lu Qin, Jeffrey Xu Yu, Lijun Chang
CIKM
2008
Springer
13 years 9 months ago
A sparse gaussian processes classification framework for fast tag suggestions
Tagged data is rapidly becoming more available on the World Wide Web. Web sites which populate tagging services offer a good way for Internet users to share their knowledge. An in...
Yang Song, Lu Zhang 0007, C. Lee Giles
BMCBI
2008
99views more  BMCBI 2008»
13 years 7 months ago
Multiple organism algorithm for finding ultraconserved elements
Background: Ultraconserved elements are nucleotide or protein sequences with 100% identity (no mismatches, insertions, or deletions) in the same organism or between two or more or...
Scott Christley, Neil F. Lobo, Gregory R. Madey
PVLDB
2008
110views more  PVLDB 2008»
13 years 7 months ago
Online maintenance of very large random samples on flash storage
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
Suman Nath, Phillip B. Gibbons
ICTAC
2010
Springer
13 years 5 months ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett