Sciweavers

332 search results - page 37 / 67
» The Monochromatic Column problem
Sort
View
CVPR
2003
IEEE
14 years 12 months ago
Kernel Principal Angles for Classification Machines with Applications to Image Sequence Interpretation
We consider the problem of learning with instances defined over a space of sets of vectors. We derive a new positive definite kernel f(A B) defined over pairs of matrices A B base...
Lior Wolf, Amnon Shashua
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
14 years 10 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
13 years 7 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
14 years 10 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
14 years 4 months ago
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...
Christoph Dürr, Flavio Guiñez, Mart&ia...