Sciweavers

53 search results - page 9 / 11
» PrefIndex: An Efficient Supergraph Containment Search Techni...
Sort
View
BMCBI
2008
115views more  BMCBI 2008»
13 years 11 months ago
PARPST: a PARallel algorithm to find peptide sequence tags
Background: Protein identification is one of the most challenging problems in proteomics. Tandem mass spectrometry provides an important tool to handle the protein identification ...
Sara Brunetti, Elena Lodi, Elisa Mori, Maria Stell...
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
14 years 11 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...
AI
2000
Springer
13 years 10 months ago
EXPTIME tableaux for ALC
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r....
Francesco M. Donini, Fabio Massacci
JCM
2007
131views more  JCM 2007»
13 years 10 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze
APWEB
2006
Springer
14 years 2 months ago
Sample Sizes for Query Probing in Uncooperative Distributed Information Retrieval
The goal of distributed information retrieval is to support effective searching over multiple document collections. For efficiency, queries should be routed to only those collectio...
Milad Shokouhi, Falk Scholer, Justin Zobel