Sciweavers

10608 search results - page 184 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
DAM
2008
131views more  DAM 2008»
13 years 10 months ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 10 months ago
The Complexity of Mean Flow Time Scheduling Problems with Release Times
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
Philippe Baptiste, Peter Brucker, Marek Chrobak, C...
IJHPCA
2008
104views more  IJHPCA 2008»
13 years 10 months ago
Low-Complexity Principal Component Analysis for Hyperspectral Image Compression
Principal component analysis (PCA) is an effective tool for spectral decorrelation of hyperspectral imagery, and PCA-based spectral transforms have been employed successfully in co...
Qian Du, James E. Fowler
CANDC
2000
ACM
13 years 10 months ago
Sequence Complexity for Biological Sequence Analysis
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
Lloyd Allison, Linda Stern, Timothy Edgoose, Trevo...
TOG
2002
127views more  TOG 2002»
13 years 10 months ago
Progressive lossless compression of arbitrary simplicial complexes
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
Pierre-Marie Gandoin, Olivier Devillers