Sciweavers

67 search results - page 7 / 14
» Percentile Finding Algorithm for Multiple Sorted Runs
Sort
View
CPM
2006
Springer
145views Combinatorics» more  CPM 2006»
13 years 11 months ago
Approximation of RNA Multiple Structural Alignment
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
Marcin Kubica, Romeo Rizzi, Stéphane Vialet...
KAIS
2008
165views more  KAIS 2008»
13 years 7 months ago
Multirelational classification: a multiple view approach
Multirelational classification aims at discovering useful patterns across multiple inter-connected tables (relations) in a relational database. Many traditional learning techniques...
Hongyu Guo, Herna L. Viktor
STOC
2005
ACM
174views Algorithms» more  STOC 2005»
14 years 7 months ago
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
14 years 9 months ago
Weighted Proximity Best-Joins for Information Retrieval
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
AnHai Doan, Haixun Wang, Hao He, Jun Yang 0001, Ri...
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
14 years 8 months ago
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
Shurug Al-Khalifa, H. V. Jagadish, Jignesh M. Pate...