3894 search results - page 340 / 779 » Approximation Algorithms for Biclustering Problems |
170
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
This paper surveys recent work in applying ideas from graphical models and message passing algorithms to solve large scale regularized regression problems. In particular, the focu...
193
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
151
click to vote
MOBIHOC
2006
ACM
16 years 5 months ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
143
click to vote
CIKM
2009
Springer
16 years 25 days ago
2009
Springer
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...
162
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...