Sciweavers

3019 search results - page 138 / 604
» Approximating the Domatic Number
Sort
View
COMPGEOM
2007
ACM
15 years 10 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
COCOA
2008
Springer
15 years 8 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
BMCBI
2010
131views more  BMCBI 2010»
15 years 6 months ago
A comparison of approximation techniques for variance-based sensitivity analysis of biochemical reaction systems
Background: Sensitivity analysis is an indispensable tool for the analysis of complex systems. In a recent paper, we have introduced a thermodynamically consistent variance-based ...
Hong-Xuan Zhang, John Goutsias
RCIS
2010
15 years 4 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 6 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...