177 search results - page 34 / 36 » Uniform Hashing in Constant Time and Optimal Space |
167
click to vote
BROADNETS
2007
IEEE
16 years 9 days ago
2007
IEEE
— Network dimensioning for wavelength-routed WDM networks has been extensively studied to maximize connection acceptance rate while minimizing the total cost. However, Internet s...
258
click to vote
ICDT
2009
ACM
16 years 6 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
197
click to vote
CORR
2010
Springer
15 years 26 days ago
2010
Springer
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
182
click to vote
INFOCOM
2011
IEEE
14 years 9 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
166
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...