477 search results - page 42 / 96 » Algorithms for dynamic geometric problems over data streams |
165
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
We address the problem of preserving privacy in streams, which has received surprisingly limited attention. For static data, a well-studied and widely used approach is based on ra...
116
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
133
click to vote
ARC
2012
Springer
13 years 5 months ago
2012
Springer
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
To cope with concept drift, we paired a stable online learner with a reactive one. A stable learner predicts based on all of its experience, whereas a reactive learner predicts ba...
107
click to vote
3DPVT
2006
IEEE
15 years 4 months ago
2006
IEEE
Interactive network-based navigation over large urban environments raises difficult problems due to the size and complexity of these scenes. In this paper, we present a clientser...