1208 search results - page 90 / 242 » Uniform eventown problems |
FATES
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents a method for reducing the cost of test generation. A spanning set for a coverage criterion is a set of entities such that exercising every entity in the spannin...
TIME
2002
IEEE
15 years 3 months ago
2002
IEEE
In this paper, we propose a logical approach to represent and reason about different time granularities. We identify a time granularity as a discrete infinite sequence of time po...
100
click to vote
AISC
2010
Springer
15 years 2 months ago
2010
Springer
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different bounda...
PODC
2009
ACM
15 years 2 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
78
Voted
ICMCS
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper we address the question: Is water-filling appropriate for watermarking? The water-filling paradigm is a traditional solution to the capacity maximization of parall...