1068 search results - page 179 / 214 » On Space Bounded Server Algorithms |
102
click to vote
SODA
1998
ACM
15 years 4 months ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
142
click to vote
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
275
click to vote
ICDE
2012
IEEE
13 years 5 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
219
click to vote
VLDB
2004
ACM
16 years 3 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...
142
click to vote
SIGMOD
2003
ACM
16 years 3 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 ...