1040 search results - page 154 / 208 » Rounding algorithms for covering problems |
126
click to vote
CLA
2007
15 years 5 months ago
2007
Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes B...
125
click to vote
OPODIS
2008
15 years 5 months ago
2008
Abstract. We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered b...
113
click to vote
CGF
1999
15 years 4 months ago
1999
There has been a rapid technical progress in three-dimensional (3D) computer graphics. But gathering surface and texture data is yet a laborious task. This paper addresses the pro...
129
click to vote
ASPDAC
2010
ACM
15 years 2 months ago
2010
ACM
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
160
click to vote
MIA
2011
14 years 7 months ago
2011
In this work we propose a comprehensive study of Digital Stent Enhancement (DSE), from the analysis of requirements to the validation of the proposed solution. First, we derive th...