1629 search results - page 153 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
86
Voted
ACSC
2003
IEEE
15 years 3 months ago
2003
IEEE
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...
66
Voted
ISCAS
2006
IEEE
15 years 4 months ago
2006
IEEE
—As turbo decoding is a highly memory-intensive algorithm consuming large power, a major issue to be solved in practical implementation is to reduce power consumption. This paper...
ICML
2006
IEEE
15 years 11 months ago
2006
IEEE
An intuitive approach to utilizing unlabeled data in kernel-based classification algorithms is to simply treat unknown labels as additional optimization variables. For marginbased...
68
Voted
AAAI
2004
14 years 11 months ago
2004
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
91
Voted
ICTAC
2004
Springer
15 years 3 months ago
2004
Springer
A model-based approach for minimization of test sets for interactive systems is introduced. Test cases are efficiently generated and selected to cover the behavioral model and the ...