Sciweavers

1749 search results - page 236 / 350
» Conditional colorings of graphs
Sort
View
DAM
2011
15 years 1 months ago
Weak sense of direction labelings and graph embeddings
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...
Christine T. Cheng, Ichiro Suzuki
AIPS
2010
15 years 9 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
IM
2008
15 years 6 months ago
Directed Random Dot Product Graphs
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
Stephen J. Young, Edward R. Scheinerman
CIKM
2004
Springer
16 years 4 days ago
Node ranking in labeled directed graphs
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 ...
Krishna Prasad Chitrapura, Srinivas R. Kashyap
156
Voted
ICC
2007
IEEE
145views Communications» more  ICC 2007»
16 years 1 months ago
Enhancements to Cognitive Radio Based IEEE 802.22 Air-Interface
—The IEEE 802.22 standard for wireless regional area network is the first standard for cognitive radio that tries to harness the idle or under-utilized spectrum allocated for TV...
Shamik Sengupta, Swastik Brahma, Mainak Chatterjee...