Sciweavers

16404 search results - page 927 / 3281
» A set coverage problem
Sort
View
DAM
2010
137views more  DAM 2010»
15 years 7 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...

Book
357views
17 years 5 months ago
Foundations of Constraint Satisfaction
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
Edward Tsang
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
16 years 9 months ago
Topology Search over Biological Databases
We introduce the notion of a data topology and the problem of topology search over databases. A data topology summarizes the set of all possible relationships that connect a given...
Lin Guo, Jayavel Shanmugasundaram, Golan Yona
ICDE
2006
IEEE
116views Database» more  ICDE 2006»
16 years 9 months ago
Predicate-based Filtering of XPath Expressions
The XML/XPath filtering problem has found wide-spread interest. In this paper, we propose a novel algorithm for solving it. Our approach encodes XPath expressions (XPEs) as ordere...
Shuang Hou, Hans-Arno Jacobsen
ICML
2005
IEEE
16 years 8 months ago
A general regression technique for learning transductions
The problem of learning a transduction, that is a string-to-string mapping, is a common problem arising in natural language processing and computational biology. Previous methods ...
Corinna Cortes, Mehryar Mohri, Jason Weston