697 search results - page 38 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
ACISICIS
2005
IEEE
13 years 9 months ago
2005
IEEE
This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation i...
IFIPTCS
2010
13 years 5 months ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
BMCBI
2008
13 years 8 months ago
2008
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
SSDBM
2010
IEEE
13 years 5 months ago
2010
IEEE
Skyline queries have attracted considerable attention over the last few years, mainly due to their ability to return interesting objects without the need for user-defined scoring f...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...