Sciweavers

1322 search results - page 75 / 265
» Parameterized counting problems
Sort
View
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
14 years 1 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
DKE
2008
109views more  DKE 2008»
13 years 9 months ago
Deterministic algorithms for sampling count data
Processing and extracting meaningful knowledge from count data is an important problem in data mining. The volume of data is increasing dramatically as the data is generated by da...
Hüseyin Akcan, Alex Astashyn, Hervé Br...
IANDC
2008
76views more  IANDC 2008»
13 years 9 months ago
The number of convex permutominoes
Permutominoes are polyominoes defined by suitable pairs of permutations. In this paper we provide a formula to count the number of convex permutominoes of given perimeter. To this ...
Paolo Boldi, Violetta Lonati, Roberto Radicioni, M...
COCO
2006
Springer
113views Algorithms» more  COCO 2006»
14 years 18 days ago
On the Complexity of Numerical Analysis
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
Eric Allender, Peter Bürgisser, Johan Kjeldga...
COMPGEOM
2001
ACM
14 years 15 days ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun