1773 search results - page 36 / 355 » A new partitioning scheme for improvement of image computati... |
FOCS
2002
IEEE
14 years 15 days ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
Compression ratio and computational complexity are two major factors for a successful image coder. By exploring the Laplacian distribution of the wavelet coefficients, a new bit ...
AUSAI
2003
Springer
14 years 23 days ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
IBPRIA
2005
Springer
14 years 1 months ago
2005
Springer
The process of mixing labelled and unlabelled data is being recently studied in semi-supervision techniques. However, this is not the only scenario in which mixture of labelled and...
SEBD
2004
13 years 9 months ago
2004
Abstract. The need to compress data into synopses of summarized information often arises in many application scenarios, where the aim is to retrieve aggregate data efficiently, pos...