249 search results - page 45 / 50 » Analysis of Resource Lower Bounds in Real-Time Applications |
207
click to vote
POPL
2009
ACM
16 years 9 days ago
2009
ACM
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
101
click to vote
KDD
2009
ACM
16 years 6 days ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
—The Grassmann manifold Gn,p (L) is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space Ln , where L is either R or C. This paper consid...
185
click to vote
VLDB
2004
ACM
15 years 12 months ago
2004
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
106
click to vote
SIGMOD
2003
ACM
15 years 11 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...