1736 search results - page 155 / 348 » On antimagic directed graphs |
181
click to vote
WWW
2003
ACM
16 years 7 months ago
2003
ACM
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as ...
187
click to vote
WSDM
2009
ACM
16 years 1 months ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
193
click to vote
WINE
2009
Springer
16 years 1 months ago
2009
Springer
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
187
click to vote
AICCSA
2007
IEEE
16 years 28 days ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
162
click to vote
FOCS
2007
IEEE
16 years 27 days ago
2007
IEEE
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...