1722 search results - page 236 / 345 » On the sample mean of graphs |
164
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
178
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
152
click to vote
PERCOM
2006
ACM
16 years 6 months ago
2006
ACM
The increasing availability of information about people's context makes it possible to deploy context-sensitive services, where access to resources provided or managed by a s...
170
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
When classifying high-dimensional sequence data, traditional methods (e.g., HMMs, CRFs) may require large amounts of training data to avoid overfitting. In such cases dimensional...
173
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
We propose Recursive Compositional Models (RCMs) for simultaneous multi-view multi-object detection and parsing (e.g. view estimation and determining the positions of the object s...