Sciweavers

3368 search results - page 308 / 674
» The Complexity of Query Reliability
Sort
View
BMCBI
2008
110views more  BMCBI 2008»
15 years 6 months ago
Predikin and PredikinDB: a computational framework for the prediction of protein kinase peptide specificity and an associated da
Background: We have previously described an approach to predicting the substrate specificity of serine-threonine protein kinases. The method, named Predikin, identifies key conser...
Neil F. W. Saunders, Ross I. Brinkworth, Thomas Hu...
ICDE
2003
IEEE
139views Database» more  ICDE 2003»
16 years 8 months ago
Super-Fast XML Wrapper Generation in DB2: A Demonstration
The XML Wrapper is a new feature of the federated database capabilities of DB2/UDB v8. It enables users and applications to issue SQL queries against XML data from a variety of so...
Vanja Josifovski, Sabine Massmann, Felix Naumann
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 6 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
ISCA
2009
IEEE
137views Hardware» more  ISCA 2009»
16 years 1 months ago
A case for an interleaving constrained shared-memory multi-processor
Shared-memory multi-threaded programming is inherently more difficult than single-threaded programming. The main source of complexity is that, the threads of an application can in...
Jie Yu, Satish Narayanasamy
NGC
2000
Springer
15 years 10 months ago
The use of hop-limits to provide survivable ATM group communications
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
William Yurcik, David Tipper, Deep Medhi