Sciweavers

361 search results - page 8 / 73
» Maximum subset intersection
Sort
View
FOCS
2006
IEEE
15 years 8 months ago
Algebraic Structures and Algorithms for Matching and Matroid Problems
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
Nicholas J. A. Harvey
DCC
2010
IEEE
15 years 2 months ago
The maximum size of a partial 3-spread in a finite vector space over GF(2)
Let n 3 be an integer, let Vn(2) denote the vector space of dimension n over GF(2), and let c be the least residue of n modulo 3. We prove that the maximum number of 3-dimensional...
Saad El-Zanati, H. Jordon, G. F. Seelinger, Papa S...
EDBT
2011
ACM
199views Database» more  EDBT 2011»
14 years 5 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
15 years 6 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
15 years 8 months ago
Anomalous window discovery through scan statistics for linear intersecting paths (SSLIP)
Anomalous windows are the contiguous groupings of data points. In this paper, we propose an approach for discovering anomalous windows using Scan Statistics for Linear Intersectin...
Lei Shi, Vandana Pursnani Janeja