513 search results - page 98 / 103 » Soft Edge Coloring |
108
click to vote
SIROCCO
2007
15 years 1 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
103
click to vote
BMCBI
2010
15 years 16 days ago
2010
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
102
Voted
JCT
2010
14 years 11 months ago
2010
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
95
Voted
DAC
2008
ACM
16 years 1 months ago
2008
ACM
Scenario-based design exploits the time-varying execution behavior of applications by dynamically adapting the system on which they run. This is a particularly interesting design ...
129
Voted
NTMS
2009
IEEE
15 years 7 months ago
2009
IEEE
—Inter-cell interference (ICI) mitigation is always a big challenge issue in cellular systems. In this work we propose an Enhanced Fractional Frequency Reuse (EFFR) scheme combin...