10608 search results - page 58 / 2122 » Complexity of O'Hara's Algorithm |
PODC
2006
ACM
14 years 3 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
ICIP
2001
IEEE
14 years 11 months ago
2001
IEEE
Variable-complexity algorithms provide a means of managing the computational complexity of a software video CODEC. The reduction in computational complexity provided by existing v...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
ANCS
2005
ACM
14 years 3 months ago
2005
ACM
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
ADMA
2006
Springer
14 years 3 months ago
2006
Springer
Feature selection is an important data preprocessing step in data mining and pattern recognition. Many algorithms have been proposed in the past for simple patterns that can be cha...