Sciweavers

363 search results - page 66 / 73
» Partial Multicuts in Trees
Sort
View
COMPGEOM
2007
ACM
14 years 1 months ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir
BMCBI
2007
135views more  BMCBI 2007»
13 years 10 months ago
RECOVIR: An application package to automatically identify some single stranded RNA viruses using capsid protein residues that un
Background: Most single stranded RNA (ssRNA) viruses mutate rapidly to generate large number of strains having highly divergent capsid sequences. Accurate strain recognition in un...
Dianhui Zhu, George E. Fox, Sugoto Chakravarty
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 10 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...
ICEIS
2009
IEEE
14 years 4 months ago
Semi-supervised Information Extraction from Variable-length Web-page Lists
We propose two methods for constructing automated programs for extraction of information from a class of web pages that are very common and of high practical significance - varia...
Daniel Nikovski, Alan Esenther, Akihiro Baba
IWPEC
2009
Springer
14 years 4 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...