Sciweavers

Share
KDD
2012
ACM
217views Data Mining» more  KDD 2012»
6 years 9 months ago
The long and the short of it: summarising event sequences with serial episodes
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...
Nikolaj Tatti, Jilles Vreeken
CORR
2012
Springer
176views Education» more  CORR 2012»
7 years 3 months ago
Capturing Topology in Graph Pattern Matching
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...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...
ESA
2011
Springer
252views Algorithms» more  ESA 2011»
7 years 7 months ago
Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane
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...
Nabil H. Mustafa, Saurabh Ray, Mudassir Shabbir
ALGORITHMICA
2011
7 years 11 months ago
Algorithms for Marketing-Mix Optimization
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 ...
Joachim Gudmundsson, Pat Morin, Michiel H. M. Smid
SIAMDM
2002
85views more  SIAMDM 2002»
8 years 7 months ago
Finding a 2-Core of a Tree in Linear Time
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...
Biing-Feng Wang
ALGORITHMICA
2000
85views more  ALGORITHMICA 2000»
8 years 7 months ago
An Algorithm for Enumerating All Spanning Trees of a Directed Graph
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...
Sanjiv Kapoor, H. Ramesh
DAM
2010
81views more  DAM 2010»
8 years 7 months ago
The k-in-a-tree problem for graphs of girth at least k
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...
W. Liu, Nicolas Trotignon
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
8 years 8 months ago
On finding a guard that sees most and a shop that sells most
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...
Otfried Cheong, Alon Efrat, Sariel Har-Peled
CIE
2010
Springer
8 years 10 months ago
A Faster Algorithm for Finding Minimum Tucker Submatrices
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...
Guillaume Blin, Romeo Rizzi, Stéphane Viale...
COCO
2010
Springer
133views Algorithms» more  COCO 2010»
8 years 11 months ago
Spectral Algorithms for Unique Games
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...
Alexandra Kolla
books