2925 search results - page 57 / 585 » Information Complexity of Online Problems |
169
click to vote
CISS
2008
IEEE
16 years 14 days ago
2008
IEEE
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
152
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
In dynamic environments with frequent content updates, we require online full-text search that scales to large data collections and achieves low search latency. Several recent met...
165
click to vote
ECCV
2008
Springer
16 years 7 months ago
2008
Springer
We present a new Gaussian Process inference algorithm, called Online Sparse Matrix Gaussian Processes (OSMGP), and demonstrate its merits with a few vision applications. The OSMGP ...
247
click to vote
ICDE
1998
IEEE
16 years 7 months ago
1998
IEEE
We have a large database consisting of sales transactions. We investigate the problem of online mining of association rules in this large database. We show how to preprocess the d...
235
click to vote
HICSS
2005
IEEE
15 years 11 months ago
2005
IEEE
Research in information sciences in recent years has dealt with how to support collaborative work across time, space and organizational boundaries. However, this research neglecte...