3211 search results - page 383 / 643 » On the Grundy Number of a Graph |
186
click to vote
TAMC
2009
Springer
16 years 1 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
165
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
224
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
—Distributed denial-of-service attacks (DDoS) pose an immense threat to the Internet. The most studied solution is to let routers probabilistically mark packets with partial path...
160
click to vote
SMC
2007
IEEE
16 years 28 days ago
2007
IEEE
— This paper presents two approaches to visually analyze the topic shift of a pool of documents over a given period of time. The first of the proposed methods is based on a mult...
186
click to vote
MICAI
2007
Springer
16 years 24 days ago
2007
Springer
Among various document clustering algorithms that have been proposed so far, the most useful are those that automatically reveal the number of clusters and assign each target docum...