60 search results - page 10 / 12 » On Binary Searching with Nonuniform Costs |
TRECVID
2008
13 years 6 months ago
2008
We have developed and evaluated three generalized systems for event detection. The first system is a simple brute force search method, where each space-time location in the video ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
ADBIS
2007
Springer
13 years 9 months ago
2007
Springer
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
SODA
1993
ACM
13 years 6 months ago
1993
ACM
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
PODC
2009
ACM
14 years 5 months ago
2009
ACM
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...