Sciweavers

154 search results - page 31 / 31
» Algorithms for Implicit Hitting Set Problems
Sort
View
RECSYS
2009
ACM
15 years 4 months ago
Uncovering functional dependencies in MDD-compiled product catalogues
A functional dependency is a logical relationship amongst the attributes that define a table of data. Specifically, a functional dependency holds when the values of a subset of ...
Tarik Hadzic, Barry O'Sullivan
100
Voted
KR
2004
Springer
15 years 2 months ago
Planning Graphs and Knowledge Compilation
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
Hector Geffner
FOCS
2000
IEEE
15 years 1 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
BMCBI
2006
130views more  BMCBI 2006»
14 years 9 months ago
MicroTar: predicting microRNA targets from RNA duplexes
Background: The accurate prediction of a comprehensive set of messenger RNAs (targets) regulated by animal microRNAs (miRNAs) remains an open problem. In particular, the predictio...
Rahul Thadani, Martti T. Tammi