3894 search results - page 646 / 779 » Approximation Algorithms for Biclustering Problems |
154
Voted
ICDM
2010
IEEE
15 years 1 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
127
Voted
JGO
2010
14 years 10 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
164
Voted
SIAMSC
2011
14 years 10 months ago
2011
We develop an algebraic multigrid (AMG) setup scheme based on the bootstrap framework for multiscale scientific computation. Our approach uses a weighted least squares definition...
147
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
This work considers the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case, and therefore the ICA problem is solved by...
138
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...