Sciweavers

440 search results - page 72 / 88
» On partial randomness
Sort
View
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 1 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
119
Voted
CORR
2011
Springer
143views Education» more  CORR 2011»
14 years 5 months ago
Non-malleable extractors via character sums
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
Trevor D. Wooley, David Zuckerman
199
Voted
DC
2011
14 years 1 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
QUESTA
2006
94views more  QUESTA 2006»
15 years 1 months ago
Modeling teletraffic arrivals by a Poisson cluster process
In this paper we consider a Poisson cluster process N as a generating process for the arrivals of packets to a server. This process generalizes in a more realistic way the infinite...
Gilles Faÿ, Bárbara González-Ar...
RECOMB
2005
Springer
16 years 2 months ago
Towards an Integrated Protein-Protein Interaction Network
Abstract. Protein-protein interactions play a major role in most cellular processes. Thus, the challenge of identifying the full repertoire of interacting proteins in the cell is o...
Ariel Jaimovich, Gal Elidan, Hanah Margalit, Nir F...