KDD
2012
ACM
12 years 1 months ago
2012
ACM
An ideal outcome of pattern mining is a small set of informative patterns, containing no redundancy or noise, that identifies the key structure of the data at hand. Standard freq...
CORR
2012
Springer
12 years 6 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
ESA
2011
Springer
12 years 10 months ago
2011
Springer
Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in R2 . These include Tukey depth [15], O...
ALGORITHMICA
2011
13 years 2 months ago
2011
Algorithms for determining quality/cost/price tradeoffs in saturated markets are consid-3 ered. A product is modeled by d real-valued qualities whose sum determines the unit cost ...
SIAMDM
2002
13 years 10 months ago
2002
Let T be an edge-weighted tree. A p-core of T is a set of p mutually disjoint paths in T that minimizes the sum of the distances of all vertices in T from any of the p paths, where...
ALGORITHMICA
2000
13 years 10 months ago
2000
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
DAM
2010
13 years 11 months ago
2010
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
SODA
2004
ACM
14 years 10 days ago
2004
ACM
We present a near-quadratic time algorithm that computes a point inside a simple polygon P having approximately the largest visibility polygon inside P, and a nearlinear time algo...
CIE
2010
Springer
14 years 2 months ago
2010
Springer
A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. Algorithmic issues of the C1P are centr...
COCO
2010
Springer
14 years 2 months ago
2010
Springer
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...