500 search results - page 47 / 100 » Approximation algorithms for maximum independent set of pseu... |
145
click to vote
KDD
2009
ACM
16 years 2 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...
112
Voted
NIPS
2007
15 years 3 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
138
click to vote
SIGECOM
2009
ACM
15 years 8 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
118
click to vote
ASPDAC
2008
ACM
15 years 3 months ago
2008
ACM
Abstract-- We address performance maximization of independent task sets under energy constraint on chip multi-processor (CMP) architectures that support multiple voltage/frequency ...
112
click to vote
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
—Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, Forward Error Correc...