1898 search results - page 193 / 380 » Weak Keys for IDEA |
JACM
2000
13 years 10 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
ECCV
2006
Springer
15 years 1 days ago
2006
Springer
Abstract. In this paper, we introduce background cut, a high quality and realtime foreground layer extraction algorithm. From a single video sequence with a moving foreground objec...
STOC
2004
ACM
14 years 10 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
EDBT
2004
ACM
14 years 10 months ago
2004
ACM
Earlier work has demonstrated the effectiveness of in-network data aggregation in order to minimize the amount of messages exchanged during continuous queries in large sensor netwo...
ICCD
2004
IEEE
14 years 7 months ago
2004
IEEE
1 Many computer security threats involve execution of unauthorized foreign code on the victim computer. Viruses, network and email worms, Trojan horses, backdoor programs used in ...