Sciweavers

764 search results - page 87 / 153
» Maximum-Margin Matrix Factorization
Sort
View
KDD
2002
ACM
109views Data Mining» more  KDD 2002»
15 years 10 months ago
Topics in 0--1 data
Large 0-1 datasets arise in various applications, such as market basket analysis and information retrieval. We concentrate on the study of topic models, aiming at results which in...
Ella Bingham, Heikki Mannila, Jouni K. Seppän...
COCO
2009
Springer
119views Algorithms» more  COCO 2009»
15 years 4 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman
IMC
2007
ACM
14 years 11 months ago
Blind source separation approach to performance diagnosis and dependency discovery
We consider the problem of diagnosing performance problems in distributed system and networks given end-to-end performance measurements provided by test transactions, or probes. C...
Gaurav Chandalia, Irina Rish
ALGORITHMICA
2007
114views more  ALGORITHMICA 2007»
14 years 10 months ago
The Consecutive Ones Submatrix Problem for Sparse Matrices
A 0-1 matrix has the Consecutive Ones Property (C1P) if there is a permutation of its columns that leaves the 1’s consecutive in each row. The Consecutive Ones Submatrix (C1S) p...
Jinsong Tan, Louxin Zhang
JISE
2006
85views more  JISE 2006»
14 years 10 months ago
A Programming Methodology for Designing Block Recursive Algorithms
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms. We first express a computational problem ...
Min-Hsuan Fan, Chua-Huang Huang, Yeh-Ching Chung, ...