104 search results - page 17 / 21 » Efficient Algorithms for k Maximum Sums |
TCSV
2008
13 years 7 months ago
2008
Since motion-compensated temporal filtering (MCTF) becomes an important temporal prediction scheme in video coding algorithms, this paper presents an efficient temporal prediction ...
ICCV
2009
IEEE
15 years 11 days ago
2009
IEEE
We present some theoretical results related to the problem
of actively searching for a target in a 3D environment,
under the constraint of a maximum search time. We define
the o...
TVLSI
2010
13 years 2 months ago
2010
K-Means is a clustering algorithm that is widely applied in many fields, including pattern classification and multimedia analysis. Due to real-time requirements and computational-c...
MP
2007
13 years 6 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
IAJIT
2008
13 years 7 months ago
2008
: The fuzzy c-means clustering algorithm has been widely used to obtain the fuzzy k-partitions. This algorithm requires that the user gives the number of clusters k. To find automa...