3894 search results - page 276 / 779 » Approximation Algorithms for Biclustering Problems |
198
click to vote
WAOA
2005
Springer
16 years 3 days ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
163
click to vote
SPIRE
1999
Springer
15 years 11 months ago
1999
Springer
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
154
click to vote
CAGD
2004
15 years 6 months ago
2004
Topologically consistent algorithms for the intersection and trimming of free-form parametric surfaces are of fundamental importance in computer-aided design, analysis, and manufa...
177
click to vote
INFOCOM
2007
IEEE
16 years 28 days ago
2007
IEEE
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
195
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...