Sciweavers

255 search results - page 15 / 51
» Approximate matching of secondary structures
Sort
View
ESWS
2009
Springer
14 years 4 months ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 3 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
ICDE
2006
IEEE
208views Database» more  ICDE 2006»
14 years 4 months ago
Approximate Video Search Based on Spatio-Temporal Information of Video Objects
The spatio-temporal information of a video object is important for content-based video retrieval. In this paper the spatio-temporal information of a video object, such as the velo...
Chia-Han Lin, Arbee L. P. Chen
BMCBI
2007
165views more  BMCBI 2007»
13 years 10 months ago
Ab initio identification of human microRNAs based on structure motifs
Background: MicroRNAs (miRNAs) are short, non-coding RNA molecules that are directly involved in post-transcriptional regulation of gene expression. The mature miRNA sequence bind...
Markus Brameier, Carsten Wiuf
DASFAA
2004
IEEE
138views Database» more  DASFAA 2004»
14 years 1 months ago
Counting Relaxed Twig Matches in a Tree
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
Dongwon Lee, Divesh Srivastava