1732 search results - page 55 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
196
click to vote
TRECVID
2007
15 years 7 months ago
2007
This paper describes our experiments for the high level feature extraction task in TRECVid 2007. We submitted the following five runs: • A jr1 1: Baseline run using early fusio...
139
click to vote
HASE
2007
IEEE
16 years 16 days ago
2007
IEEE
We adapt the classic cusum change-point detection algorithm for applications to data network monitoring where various and numerous performance and reliability metrics are availabl...
131
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
144
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we describe a dynamic external memory data structure that supports range reporting queries in three dimensions in O(log2 B N + k B ) I/O operations, where k is the nu...
134
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...