IJNSEC
2010
12 years 11 months ago
2010
This paper deals with a modification of the Hill cipher. In this, we have introduced interweaving in each step of the iteration. The interweaving of the resulting plaintext, at ea...
CDC
2010
IEEE
12 years 11 months ago
2010
IEEE
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
COMPUTING
2010
13 years 2 months ago
2010
In this paper, we introduce and analyze a modification of the Hermitian and skewHermitian splitting iteration method for solving a broad class of complex symmetric linear systems....
PIMRC
2010
IEEE
13 years 2 months ago
2010
IEEE
Air bandwidth is a precious resource for wireless communication. Multiple-antenna (MIMO) systems enable an increase in channel capacity without increasing the air bandwidth. An ite...
LPAR
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We present ABC, a software tool for automatically computing symbolic upper bounds on the number of iterations of nested program loops. The system combines static analysis...
JUCS
2002
13 years 4 months ago
2002
Abstract: We define rationally additive semirings that are a generalization of ()complete and (-)continuous semirings. We prove that every rationally additive semiring is an iterat...
AC
2004
Springer
13 years 4 months ago
2004
Springer
In today's business where speed is of essence, an iterative development approach that allows the functionality to be delivered in parts has become a necessity and an effectiv...
SIAMJO
2008
13 years 4 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
MLQ
2008
13 years 4 months ago
2008
We work out the details of a schema for a mixed support forcing iteration, which generalizes the Mitchell model [7] with no Aronszajn trees on 2. The main purpose of this paper is ...
COMGEO
2006
ACM
13 years 4 months ago
2006
ACM
Let S be a finite set of points in the plane and let T (S) be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configu...