138 search results - page 23 / 28 » Lower Bounds for Succinct Data Structures |
130
click to vote
SIROCCO
2003
15 years 5 months ago
2003
In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify...
144
Voted
ANCS
2007
ACM
15 years 7 months ago
2007
ACM
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
158
Voted
GLOBECOM
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract--In this paper, we consider multiple-input multipleoutput (MIMO) communication systems with combined channel covariance feedback (CCF) and channel gain feedback (CGF), her...
131
Voted
DMKD
2003
ACM
15 years 9 months ago
2003
ACM
The parallel explosions of interest in streaming data, and data mining of time series have had surprisingly little intersection. This is in spite of the fact that time series data...
144
Voted
SWAT
2000
Springer
15 years 7 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...