Sciweavers

3208 search results - page 283 / 642
» A Lower Bound for Primality
Sort
View
CSL
2007
Springer
16 years 26 days ago
On the Complexity of Reasoning About Dynamic Policies
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
Stefan Göller
SAS
2007
Springer
16 years 24 days ago
Program Analysis Using Symbolic Ranges
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
Sriram Sankaranarayanan, Franjo Ivancic, Aarti Gup...
GLOBECOM
2006
IEEE
16 years 22 days ago
Performance Analysis and Optimal Signal Designs for Minimum Decoding Complexity ABBA Codes
— ABBA codes, a class of quasi-orthogonal space-time block codes (STBC) proposed by Tirkkonen et al., have been studied extensively for various applications. Yuen et al. have rec...
Dung Ngoc Dao, Chintha Tellambura
148
Voted
COCOON
2005
Springer
16 years 6 days ago
Oblivious and Adaptive Strategies for the Majority and Plurality Problems
In the well-studied Majority problem, we are given a set of n balls colored with two or more colors, and the goal is to use the minimum number of color comparisons to find a ball ...
Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew...
ISAAC
2005
Springer
106views Algorithms» more  ISAAC 2005»
16 years 5 days ago
Distance Labeling in Hyperbolic Graphs
A graph G is δ-hyperbolic if for any four vertices u, v, x, y of G the two larger of the three distance sums dG(u, v) + dG(x, y), dG(u, x) + dG(v, y), dG(u, y) + dG(v, x) differ b...
Cyril Gavoille, Olivier Ly