Results 1  10
of
517
The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms
 Russian Math. Surveys
, 1970
"... In 1964 Kolmogorov introduced the concept of the complexity of a finite object (for instance, the words in a certain alphabet). He defined complexity as the minimum number of binary signs containing all the information about a given object that are sufficient for its recovery (decoding). This defini ..."
Abstract

Cited by 235 (1 self)
 Add to MetaCart
In 1964 Kolmogorov introduced the concept of the complexity of a finite object (for instance, the words in a certain alphabet). He defined complexity as the minimum number of binary signs containing all the information about a given object that are sufficient for its recovery (decoding
Impact of Alphabet Knowledge on Online Writer Identification
"... Character prototype approaches for writer identification produces a consistent set of templates that are used to model the handwriting styles of writers, thereby allowing high accuracies to be attained. This paper extends such work on writer identification by investigating the usage of alphabet know ..."
Abstract
 Add to MetaCart
knowledge derived from the character prototypes. In addition, we demonstrate the concept of discriminative power of alphabets. It is not unconceivable that certain alphabets allow writers to express their individuality of handwriting with a more distinct and unique style compared with other alphabets
Parallel Construction Of Optimal Alphabetic Trees
 PROCEEDINGS OF THE 5 TH ACM SYMPOSIUM ON PARALLEL ALGORITHMS AND ARCHITECTURES
, 1993
"... A parallel algorithm is given which constructs an optimal alphabetic tree in O(log³ n) time with n² log n processors. The construction is basically a parallelization of the GarsiaWachs version [5] of the Hutucker algorithm [8]. The best previous NC algorithm for the problem uses n 6 = log O(1) ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
) n processors. [15] Our method is an extension of techniques used first in [3] and later used in [13] for the Huffman coding problem, which can be viewed as the alphabetic tree problem for the special case of a monotone weight sequence. In this paper, we extend to the case of certain "
Race, Ethnicity, and Alphabetically Ordered Ballots
"... A number of scholars have recently argued that ballot order effects give certain candidates an unfair advantage in elections and have urged states to randomize or rotate the order of candidate names to make elections more rational and fair. This article suggests that advocates of reform have been to ..."
Abstract
 Add to MetaCart
that infringe fundamental voting rights than laws that merely regulate elections, the discriminatory impact of alphabetic ordering rules significantly bolsters the case to rotate or randomize ballot order. Anumber of scholars have recently arguedthat ballot order effects give certain candidates an unfair
On Average Throughput and Alphabet Size in Network Coding
 IEEE TRANSACTION ON INFORMATION THEORY (TO APPEAR)
, 2005
"... We examine the throughput benefits that network coding offers with respect to the average throughput achievable by routing, where the average throughput refers to the average of the rates that the individual receivers experience. We relate these benefits to the integrality gap of a standard LP for ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
throughput measures in networks, and show how in certain classes of networks, average throughput bounds can be translated into minimum throughput bounds, by employing vector routing and channel coding. Finally, we show configurations where use of randomized coding may require an alphabet size exponentially
Ergodic optimization for countable alphabet subshifts of finite type
 ERGOD. TH. & DYN. SYS
, 2006
"... Let X be a onesided subshift of finite type on a countable alphabet, and T: X → X the shift map. If f: X → R is continuous, we provide conditions guaranteeing that fmaximizing measures exist, and are characterised by the condition that their support lies in a certain compact set. ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Let X be a onesided subshift of finite type on a countable alphabet, and T: X → X the shift map. If f: X → R is continuous, we provide conditions guaranteeing that fmaximizing measures exist, and are characterised by the condition that their support lies in a certain compact set.
The PCP theorem by gap amplification
 In Proceedings of the ThirtyEighth Annual ACM Symposium on Theory of Computing
, 2006
"... The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The celebrated equivalence of this theorem and inapproximability of certain optimization problems, due to [12], has placed the PC ..."
Abstract

Cited by 166 (8 self)
 Add to MetaCart
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The celebrated equivalence of this theorem and inapproximability of certain optimization problems, due to [12], has placed
Reconstruction of Oriya Alphabets Using Zernike Moments
"... There has been a significant amount of research in pattern recognition in different aspects of printed character based user interfaces including interactive design tools, ink beautification and printed character recognition. Optical Character recognition (OCR) systems have been effectively developed ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
different font sizes and font types. Hu‟s seven moments and Zernike moments have been progressively used to extract the features of ORIYA characters. When I reconstruct by taking the extracted features, due to certain difficulties in the Hu‟s moments I can use the Zernike moments. The methodology can
EWA KOŁODZIEJCZYK MIŁOSZ’S AMERICAN ALPHABET1
"... Abstract: This article presents a selection of Czesław Miłosz’s comments on American culture, economy and politics during his diplomatic service in the United States in the years 1946–1950. They were formulated in his postwar correspondence and in a series of articles entitled “Life in the USA, ” wh ..."
Abstract
 Add to MetaCart
translation of Negro Spirituals was, to a certain degree, his private response to the demand for folk culture at home. At the same time, he sought to play a game, rendering translations of texts whose merits he recognized, notwithstanding the political circumstances. His were the fi rst translations of Negro
Results 1  10
of
517