Sciweavers

541 search results - page 7 / 109
» Applications of nonstandard analysis in additive number theo...
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 8 months ago
Bounds on Codes Based on Graph Theory
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
Salim Y. El Rouayheb, Costas N. Georghiades, Emina...
AAAI
1990
13 years 9 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih
JCP
2008
145views more  JCP 2008»
13 years 8 months ago
Impact of Shift Operations on (-1+j)-Base Complex Binary Numbers
Complex numbers play a very important role in various applications of electrical and computer engineering. These days, arithmetic operations dealing with these numbers rely on a &q...
Tariq Jamil
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 8 months ago
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
Bernard Boigelot, Julien Brusten, Véronique...
IANDC
2008
105views more  IANDC 2008»
13 years 8 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...