Sciweavers

5699 search results - page 1036 / 1140
» Alternating model trees
Sort
View
RECOMB
2003
Springer
16 years 6 months ago
Accurate detection of very sparse sequence motifs
Protein sequence alignments are more reliable the shorter the evolutionary distance. Here, we align distantly related proteins using many closely spaced intermediate sequences as ...
Andreas Heger, Michael Lappe, Liisa Holm
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
16 years 6 months ago
To search or to crawl?: towards a query optimizer for text-centric tasks
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
Panagiotis G. Ipeirotis, Eugene Agichtein, Pranay ...
SOSP
2003
ACM
16 years 3 months ago
Model-carrying code: a practical approach for safe execution of untrusted applications
This paper presents a new approach called model-carrying code (MCC) for safe execution of untrusted code. At the heart of MCC is the idea that untrusted code comes equipped with a...
R. Sekar, V. N. Venkatakrishnan, Samik Basu, Sande...
ICSOC
2009
Springer
16 years 29 days ago
Engage: Engineering Service Modes with WS-Engineer and Dino
In this demonstration1 we present an approach to engineering service brokering requirements and capabilities using the concepts of Service Modes. The demonstration illustrates buil...
Howard Foster, Arun Mukhija, David S. Rosenblum, S...
LFCS
2009
Springer
16 years 29 days ago
Completeness Results for Memory Logics
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
Carlos Areces, Santiago Figueira, Sergio Mera
« Prev « First page 1036 / 1140 Last » Next »