Sciweavers

3690 search results - page 123 / 738
» Computation with classical sequents
Sort
View
JACM
2000
119views more  JACM 2000»
14 years 9 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
TIT
1998
139views more  TIT 1998»
14 years 9 months ago
Codes for Digital Recorders
—Constrained codes are a key component in the digital recording devices that have become ubiquitous in computer data storage and electronic entertainment applications. This paper...
Kees A. Schouhamer Immink, Paul H. Siegel, Jack K....
PE
2007
Springer
112views Optimization» more  PE 2007»
14 years 9 months ago
Scheduling in polling systems
We present a simple mean value analysis (MVA) framework for analyzing the effect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive serv...
Adam Wierman, Erik M. M. Winands, Onno J. Boxma
DCG
2010
146views more  DCG 2010»
14 years 7 months ago
An Elementary Deduction of the Topological Radon Theorem from Borsuk-Ulam
Abstract. The Topological Radon Theorem states that, for every continuous function from the boundary of a (d + 1)-dimensional simplex into Rn , there exist a pair of disjoint faces...
Craig R. Guilbault
IJNSEC
2011
106views more  IJNSEC 2011»
14 years 5 months ago
Elliptic Curve Cryptosystems and Side-channel Attacks
In this paper, we present a background on elliptic curve cryptosystems (ECCs) along with the different methods used to compute the scalar multiplication (ECSM), which is the core...
Ekambaram Kesavulu Reddy