Sciweavers

2996 search results - page 164 / 600
» Numberings and Randomness
Sort
View
151
Voted
ISMVL
2002
IEEE
82views Hardware» more  ISMVL 2002»
15 years 10 months ago
Representations of Logic Functions Using QRMDDs
This paper considers quasi-reduced multi-valued decision diagrams with bits (QRMDD( )s) to represent twovalued logic functions. It shows relations between the numbers of nodes in ...
Shinobu Nagayama, Tsutomu Sasao, Yukihiro Iguchi, ...
WINE
2009
Springer
155views Economy» more  WINE 2009»
16 years 5 days ago
Bidding for Representative Allocations for Display Advertising
Display advertising has traditionally been sold via guaranteed contracts – a guaranteed contract is a deal between a publisher and an advertiser to allocate a certain number of ...
Arpita Ghosh, Randolph Preston McAfee, Kishore Pap...
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
15 years 5 months ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
Yossi Azar, Uriel Feige, Daniel Glasner
TIT
2010
96views Education» more  TIT 2010»
15 years 9 days ago
Beyond Nyquist: efficient sampling of sparse bandlimited signals
Wideband analog signals push contemporary analog-to-digital conversion systems to their performance limits. In many applications, however, sampling at the Nyquist rate is inefficie...
Joel A. Tropp, Jason N. Laska, Marco F. Duarte, Ju...
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 7 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan