Sciweavers

2 search results - page 1 / 1
» Approximating corridors and tours via restriction and relaxa...
Sort
View
TALG
2010
86views more  TALG 2010»
13 years 3 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 5 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye