986 search results - page 162 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
KDD
2002
ACM
14 years 8 months ago
2002
ACM
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...
SIROCCO
2007
13 years 9 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...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
DIALM
2005
ACM
13 years 9 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
WEA
2010
Springer
14 years 24 days ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...