4171 search results - page 472 / 835 » Choice numbers of graphs |
175
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...
235
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...
166
click to vote
SMC
2007
IEEE
16 years 1 months 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...
191
click to vote
MICAI
2007
Springer
16 years 28 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...
198
click to vote
WG
2007
Springer
16 years 28 days ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...