Results 1  10
of
5,630
Amortized Efficiency of List Update and Paging Rules
, 1985
"... In this article we study the amortized efficiency of the “movetofront” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that movetofront is within a constant factor of optimum amo ..."
Abstract

Cited by 824 (8 self)
 Add to MetaCart
In this article we study the amortized efficiency of the “movetofront” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that movetofront is within a constant factor of optimum
Exponential bounds for list size moments and error probability
 Proceedings 1998 IEEE Information Theory Workshop (ITW
, 1998
"... Abstract We consider list decoding with a variable list size for discrete memoryless channels. We obtain simultaneous upper bounds on the error probability and the moments of list size. I. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract We consider list decoding with a variable list size for discrete memoryless channels. We obtain simultaneous upper bounds on the error probability and the moments of list size. I.
A Lower Bound on List Size for List Decoding
 In Proceedings of the 8th International Workshop on Randomization and Computation (RANDOM ‘05), number 3624 in Lecture Notes in Computer Science
, 2005
"... A qary errorcorrecting code C ⊆ {1, 2,..., q} n is said to be list decodable to radius ρ with list size L if every Hamming ball of radius ρ contains at most L codewords of C. We prove that in order for a qary code to be listdecodable up to radius (1 − 1/q)(1 − ε)n, we must have L = Ω(1/ε 2). Spe ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
A qary errorcorrecting code C ⊆ {1, 2,..., q} n is said to be list decodable to radius ρ with list size L if every Hamming ball of radius ρ contains at most L codewords of C. We prove that in order for a qary code to be listdecodable up to radius (1 − 1/q)(1 − ε)n, we must have L = Ω(1/ε 2
Learning Decision Lists
, 2001
"... This paper introduces a new representation for Boolean functions, called decision lists, and shows that they are efficiently learnable from examples. More precisely, this result is established for \kDL" { the set of decision lists with conjunctive clauses of size k at each decision. Since k ..."
Abstract

Cited by 427 (0 self)
 Add to MetaCart
This paper introduces a new representation for Boolean functions, called decision lists, and shows that they are efficiently learnable from examples. More precisely, this result is established for \kDL" { the set of decision lists with conjunctive clauses of size k at each decision. Since
Current List Size Open Form
"... Rightclick in the plot, and choose Properties to modify the plot Checkbox Subform ..."
Abstract
 Add to MetaCart
Rightclick in the plot, and choose Properties to modify the plot Checkbox Subform
Optimal Aggregation Algorithms for Middleware
 IN PODS
, 2001
"... Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade under ..."
Abstract

Cited by 717 (4 self)
 Add to MetaCart
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade
1A Combinatorial Bound on the List Size
"... We provide a simple, closedform upper bound for the classical problem of worst case listsize of a general qary block code. This new bound improves upon the best known general bound when the alphabet of the code is large. We also show that with parameters of ReedSolomon codes this bound is very c ..."
Abstract
 Add to MetaCart
We provide a simple, closedform upper bound for the classical problem of worst case listsize of a general qary block code. This new bound improves upon the best known general bound when the alphabet of the code is large. We also show that with parameters of ReedSolomon codes this bound is very
Mining Sequential Patterns: Generalizations and Performance Improvements
 RESEARCH REPORT RJ 9994, IBM ALMADEN RESEARCH
, 1995
"... The problem of mining sequential patterns was recently introduced in [3]. We are given a database of sequences, where each sequence is a list of transactions ordered by transactiontime, and each transaction is a set of items. The problem is to discover all sequential patterns with a userspecified ..."
Abstract

Cited by 759 (5 self)
 Add to MetaCart
The problem of mining sequential patterns was recently introduced in [3]. We are given a database of sequences, where each sequence is a list of transactions ordered by transactiontime, and each transaction is a set of items. The problem is to discover all sequential patterns with a user
Tor: The secondgeneration onion router,”
 in 13th USENIX Security Symposium. Usenix,
, 2004
"... Abstract We present Tor, a circuitbased lowlatency anonymous communication service. This secondgeneration Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies, an ..."
Abstract

Cited by 1229 (33 self)
 Add to MetaCart
, and efficiency. We briefly describe our experiences with an international network of more than 30 nodes. We close with a list of open problems in anonymous communication. Overview Onion Routing is a distributed overlay network designed to anonymize TCPbased applications like web browsing, secure shell
Results 1  10
of
5,630