4797 search results - page 74 / 960 » The complexity of partition tasks |
ALGORITHMICA
2002
13 years 8 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
ICIP
2006
IEEE
14 years 10 months ago
2006
IEEE
We address unsupervised variational segmentation ofmulti-look complex polarimetric images using a Wishart observation model via level sets. The methods consists of minimizing a fu...
DCC
2005
IEEE
14 years 8 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
DCC
2004
IEEE
14 years 8 months ago
2004
IEEE
We present an algorithm for lossy compression of hyperspectral images for implementation on field programmable gate arrays (FPGA). To greatly reduce the bit rate required to code ...
ICTCS
2005
Springer
14 years 2 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...