150 search results - page 2 / 30 » Fast Unimodular Counting |
ALGORITHMICA
2007
13 years 5 months ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
Abstract—In this paper, we introduce FlowSifter, a systematic framework for online application protocol field extraction. FlowSifter introduces a new grammar model Counting Regu...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—Target counting in sensor-based surveillance systems is an interesting task that potentially could have many important applications in practice. In such a system, each sensor ou...
CIKM
2011
Springer
12 years 4 months ago
2011
Springer
In most of the cases, scientists depend on previous literature which is relevant to their research fields for developing new ideas. However, it is not wise, nor possible, to trac...