Sciweavers

4 search results - page 1 / 1
» Optimal Query Complexity for Reconstructing Hypergraphs
Sort
View
STACS
2010
Springer
13 years 11 months ago
Optimal Query Complexity for Reconstructing Hypergraphs
In this paper we consider the problem of reconstructing a hidden weighted hypergraph of constant rank using additive queries. We prove the following: Let G be a weighted hidden h...
Nader H. Bshouty, Hanna Mazzawi
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 4 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
14 years 1 months ago
Optimally Reconstructing Weighted Graphs Using Queries
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
Hanna Mazzawi
BIOCOMP
2007
13 years 5 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ...
Xuehui Li, Tamer Kahveci