Sciweavers

3019 search results - page 310 / 604
» Approximating the Domatic Number
Sort
View
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
16 years 1 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
GLOBECOM
2009
IEEE
16 years 1 months ago
Anonymous Cardinality Estimation in RFID Systems with Multiple Readers
— In this paper, we study the anonymous cardinality estimation problem in radio frequency identification (RFID) systems. To preserve privacy and anonymity, each tag only transmi...
Vahid Shah-Mansouri, Vincent W. S. Wong
IISWC
2009
IEEE
16 years 1 months ago
Logicalization of communication traces from parallel execution
—Communication traces are integral to performance modeling and analysis of parallel programs. However, execution on a large number of nodes results in a large trace volume that i...
Qiang Xu, Jaspal Subhlok, Rong Zheng, Sara Voss
IPPS
2009
IEEE
16 years 1 months ago
Energy minimization for periodic real-time tasks on heterogeneous processing units
Adopting multiple processing units to enhance the computing capability or reduce the power consumption has been widely accepted for designing modern computing systems. Such confi...
Jian-Jia Chen, Andreas Schranzhofer, Lothar Thiele
COCOON
2009
Springer
16 years 1 months ago
On the Readability of Monotone Boolean Formulae
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf