Sciweavers

2735 search results - page 164 / 547
» Comparing notions of randomness
Sort
View
DCG
2006
110views more  DCG 2006»
15 years 25 days ago
High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...
David L. Donoho
98
Voted
ENTCS
2006
134views more  ENTCS 2006»
15 years 24 days ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
98
Voted
ICIP
2000
IEEE
16 years 2 months ago
Performance Analysis of an H.263 Video Encoder for VIRAM
VIRAM (Vector Intelligent Random Access Memory) is a vector architecture processor with embedded memory, designed for portable multimedia processing devices. Its vector processing...
Thinh P. Q. Nguyen, Avideh Zakhor, Katherine A. Ye...
58
Voted
ICPR
2006
IEEE
16 years 1 months ago
Component Analysis of Torah Code Phrases
In this paper, we develop a new tool, called Component Analysis (CA), to study the significance of long Torah Code phrases. CA quantifies the relevance of such a phrase, by compar...
Art Levitt
ICPR
2000
IEEE
16 years 1 months ago
Measuring the Complexity of Classification Problems
We studied a number of measures that characterize the difficulty of a classification problem. We compared a set of real world problems to random combinations of points in this mea...
Tin Kam Ho, Mitra Basu