Sciweavers

2069 search results - page 84 / 414
» Linear time algorithms for Clobber
Sort
View
MOR
2002
94views more  MOR 2002»
15 years 3 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
ICDM
2007
IEEE
129views Data Mining» more  ICDM 2007»
15 years 10 months ago
Disk Aware Discord Discovery: Finding Unusual Time Series in Terabyte Sized Datasets
The problem of finding unusual time series has recently attracted much attention, and several promising methods are now in the literature. However, virtually all proposed methods...
Dragomir Yankov, Eamonn J. Keogh, Umaa Rebbapragad...
ESA
2004
Springer
119views Algorithms» more  ESA 2004»
15 years 9 months ago
A Straight Skeleton Approximating the Medial Axis
We propose the linear axis, a new skeleton for polygonal shapes. It is related to the medial axis and the straight skeleton, being the result of a wavefront propagation process. Th...
Mirela Tanase, Remco C. Veltkamp
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 5 months ago
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
ICML
2006
IEEE
16 years 4 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan