787 search results - page 110 / 158 » Polynomial Constants are Decidable |
CISS
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper considers broadcast channels with L antennas at the base station and m single-antenna users, where each user has perfect channel knowledge and the base station obtains c...
ATVA
2006
Springer
14 years 1 months ago
2006
Springer
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
CAV
2008
Springer
13 years 11 months ago
2008
Springer
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
COCO
2008
Springer
13 years 11 months ago
2008
Springer
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
IPCV
2007
13 years 11 months ago
2007
- We propose a secure steganographic approach with a high capacity. We first use small neighborhoods of the original histogram to calculate the minimum remapping from a histogram t...