4674 search results - page 875 / 935 » cases 2008 |
126
click to vote
TALG
2008
14 years 11 months ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
SIAMCOMP
1998
14 years 11 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
100
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We analyze the modulation of a light field via nonrefracting attenuators. In the most general case, any desired modulation can be achieved with attenuators having four degrees of ...
111
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
113
click to vote
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Active learning has been shown as a key technique for improving content-based image retrieval (CBIR) performance. Among various methods, support vector machine (SVM) active learni...