Sciweavers

393 search results - page 9 / 79
» The LCA Problem Revisited
Sort
View
80
Voted
JDA
2010
107views more  JDA 2010»
15 years 8 days ago
The longest common extension problem revisited and applications to approximate string searching
Lucian Ilie, Gonzalo Navarro, Liviu Tinta
TAMC
2010
Springer
14 years 11 months ago
Revisiting the Minimum Breakpoint Linearization Problem
Laurent Bulteau, Guillaume Fertin, Irena Rusu
WWW
2007
ACM
16 years 2 months ago
Multiway SLCA-based keyword search in XML data
Keyword search for smallest lowest common ancestors (SLCAs) in XML data has recently been proposed as a meaningful way to identify interesting data nodes in XML data where their s...
Chong Sun, Chee Yong Chan, Amit K. Goenka
CISS
2008
IEEE
15 years 8 months ago
Distributed processing in frames for sparse approximation
—Beyond signal processing applications, frames are also powerful tools for modeling the sensing and information processing of many biological and man-made systems that exhibit in...
Christopher J. Rozell
CIKM
2007
Springer
15 years 8 months ago
Effective keyword search for valuable lcas over xml documents
In this paper, we study the problem of effective keyword search over XML documents. We begin by introducing the notion of Valuable Lowest Common Ancestor (VLCA) to accurately and ...
Guoliang Li, Jianhua Feng, Jianyong Wang, Lizhu Zh...