Results 1 - 10 of 1,906

Suffix arrays: A new method for on-line string searches

by Udi Manber, Gene Myers , 1991
"... A new and conceptually simple data structure, called a suffix array, for on-line string searches is intro-duced in this paper. Constructing and querying suffix arrays is reduced to a sort and search paradigm that employs novel algorithms. The main advantage of suffix arrays over suffix trees is that ..."
Abstract - Cited by 835 (0 self) - Add to MetaCart
, regardless of the alphabet size, constructs suffix arrays in O(N) expected time, albeit with lesser space efficiency. We believe that suffix arrays will prove to be better in practice than suffix trees for many applications.

Efficient Fair Queuing using Deficit Round Robin

by M. Shreedhar, George Varghese - SIGCOMM '95 , 1995
"... Fair queuing is a technique that allows each flow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: specifically, the work required to process a packet in these schemes was ..."
Abstract - Cited by 359 (4 self) - Add to MetaCart
was O(log(n)), where n is the number of active flows. This is expensive at high speeds. On the other hand, cheaper approximations of fair queuing that have been reported in the literature exhibit unfair behavior. In this paper, we describe a new approximation of fair queuing, that we call Deficit Round

Small-Bias Probability Spaces: Efficient Constructions and Applications

by Joseph Naor, Moni Naor - SIAM J. Comput , 1993
"... We show how to efficiently construct a small probability space on n binary random variables such that for every subset, its parity is either zero or one with "almost" equal probability. They are called ffl-biased random variables. The number of random bits needed to generate the random var ..."
Abstract - Cited by 276 (13 self) - Add to MetaCart
various applications: 1. Derandomization of algorithms: many randomized algorithms that require only k- wise independence of their random bits (where k is bounded by O(log n)), can be derandomized by using ffl-biased random variables. 2. Reducing the number of random bits required by certain randomized

Discriminative Reranking for Natural Language Parsing

by Michael Collins, Terry Koo , 2005
"... This article considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with associated probabilities that define an initial ranking of these parses. A second model then attempts to improve upon this i ..."
Abstract - Cited by 333 (9 self) - Add to MetaCart
—in terms of both simplicity and efficiency—to work on feature selection methods within log-linear (maximum-entropy) models. Although the experiments in this article are on natural language parsing (NLP), the approach should be applicable to many other NLP problems which are naturally framed as ranking

DryadLINQ: A System for General-Purpose Distributed Data-Parallel Computing Using a High-Level Language

by Yuan Yu, Michael Isard, Dennis Fetterly, Mihai Budiu, Úlfar Erlingsson, Pradeep Kumar, Gunda Jon Currey
"... DryadLINQ is a system and a set of language extensions that enable a new programming model for large scale distributed computing. It generalizes previous execution environments such as SQL, MapReduce, and Dryad in two ways: by adopting an expressive data model of strongly typed.NET objects; and by s ..."
Abstract - Cited by 273 (27 self) - Add to MetaCart
made up of thousands of computers, ensures efficient, reliable execution of this plan. We describe the implementation of the DryadLINQ compiler and runtime. We evaluate DryadLINQ on a varied set of programs drawn from domains such as web-graph analysis, large-scale log mining, and machine learning. We

An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms

by Tom Leighton, Satish Rao , 1989
"... In this paper, we consider a multicommodity flow problem where for each pair of vertices, (u,v), we are required to sendf half-units of commodity (uv) from u to v and f half-units of commodity (vu) from v to u without violating capacity constraints. Our main result is an algorithm for performing th9 ..."
Abstract - Cited by 246 (12 self) - Add to MetaCart
the first poly-log times optimal approximation algorithms for a wide variety of problems, including minimum quotient separators, 1/3-2/3 separators, bifurcators, crossing number and VLSI layout area. The result can also be used to efficiently route packets in arbitrary distributed networks. For example, we

Efficiently Mining Frequent Trees in a Forest

by Mohammed J. Zaki , 2002
"... Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in a forest of rooted, labeled, and ordered trees. We present TreeMiner, a novel algorithm to discover all frequent subtrees ..."
Abstract - Cited by 213 (6 self) - Add to MetaCart
approach by a factor of 4 to 20, and has good scaleup properties. We also present an application of tree mining to analyze real web logs for usage patterns.

McRT-STM: a High Performance Software Transactional Memory System for a Multi-Core Runtime

by Bratin Saha, Ali-reza Adl-tabatabai, Richard L. Hudson, Chi Cao Minh, Benjamin Hertzberg - In Proc. of the 11th ACM Symp. on Principles and Practice of Parallel Programming , 2006
"... Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed this concurrency using locks (mutex based synchronization). Unfortunately, lock based synchronization often leads to deadl ..."
Abstract - Cited by 241 (14 self) - Add to MetaCart
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed this concurrency using locks (mutex based synchronization). Unfortunately, lock based synchronization often leads

A generalisation, a simplification and some applications of Paillier's probabilistic public-key system

by Ivan Damgård, Mads Jurik - LNCS , 2001
"... We propose a generalisation of Paillier’s probabilistic public key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme even after the public key has been fixed, without loosing the homomorphic property.We show that the generalisation is as secu ..."
Abstract - Cited by 222 (2 self) - Add to MetaCart
blocks can be used for applying the scheme to efficient electronic voting. This reduces dramatically the work needed to compute the final result of an election, compared to the previously best known schemes. We show how the basic scheme for a yes/no vote can be easily adapted to casting a vote for up

Simple Efficient Load Balancing algorithms for Peer-to-Peer Systems

by David R. Karger, Matthias Ruhl - SPAA'04 , 2004
"... Load balancing is a critical issue for the efficient operation of peer-to-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a constant factor of optimal. Our protocols refine the consistent hashing data structure that underlies the Chord (and Ko ..."
Abstract - Cited by 204 (1 self) - Add to MetaCart
Load balancing is a critical issue for the efficient operation of peer-to-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a constant factor of optimal. Our protocols refine the consistent hashing data structure that underlies the Chord (and
Results 1 - 10 of 1,906