4277 search results - page 219 / 856 » On Multiple Linear Approximations |
INFOCOM
2010
IEEE
14 years 9 months ago
2010
IEEE
On today's high-speed backbone network links, measuring per-flow traffic information has become very challenging. Maintaining exact per-flow packet counters on OC-192 or OC-76...
STOC
1998
ACM
15 years 3 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
IAAI
2003
15 years 13 days ago
2003
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
WSCG
2001
15 years 13 days ago
2001
The creation and rendering of realistic water scenes is one of the challenging tasks in Computer Graphics. To reproduce the illumination and colour inside water bodies an algorith...
99
Voted
AAAI
2011
13 years 11 months ago
2011
In this paper, we propose a variant of the conservativeupdate Count-Min sketch to further reduce the overestimation error incurred. Inspired by ideas from lossy counting, we divid...