Sciweavers

652 search results - page 97 / 131
» Linear Explicit Substitutions
Sort
View
COLT
2003
Springer
15 years 11 months ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
CPM
2010
Springer
180views Combinatorics» more  CPM 2010»
15 years 10 months ago
Algorithms for Three Versions of the Shortest Common Superstring Problem
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...
EUROCRYPT
2010
Springer
15 years 10 months ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
SPAA
2009
ACM
15 years 10 months ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha
SIGMETRICS
2000
ACM
15 years 10 months ago
TCP in presence of bursty losses
In this paper we analyze the performance of a TCP-like flow control in a lossy environment. The transmission rate in the control scheme that we consider has a linear growth rate;...
Eitan Altman, Konstantin Avrachenkov, Chadi Baraka...