7015 search results - page 238 / 1403 » Approximation algorithms for co-clustering |
184
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--All-optical multicast routing (AOMR) is implemented by the concept of light-tree in WDM networks. The costoptimal multicast light-tree is NP-hard to compute, especially w...
183
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...
167
click to vote
PODS
2004
ACM
16 years 6 months ago
2004
ACM
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...
155
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
We present a dynamic voltage scaling (DVS) technique that minimizes system-wide energy consumption for both periodic and sporadic tasks. It is known that a system consists of proc...
180
click to vote
SIGMETRICS
2000
ACM
15 years 11 months ago
2000
ACM
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...