1605 search results - page 31 / 321 » On Partitional Labelings of Graphs |
DAM
2011
13 years 3 months ago
2011
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
TMM
2010
13 years 3 months ago
2010
Previous video summarization studies focused on monocular videos, and the results would not be good if they were applied to multi-view videos directly, due to problems such as the ...
MASCOTS
2003
13 years 10 months ago
2003
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
CIKM
2004
Springer
14 years 2 months ago
2004
Springer
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
ALT
2008
Springer
14 years 5 months ago
2008
Springer
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...