Sciweavers

2463 search results - page 39 / 493
» Rankings of Directed Graphs
Sort
View
EJC
2010
13 years 9 months ago
Some graphs related to the small Mathieu groups
Two different constructions are given of a rank 8 arc-transitive graph with 165 vertices and valency 8, whose automorphism group
Alice Devillers, Michael Giudici, Cai Heng Li, Che...
CISS
2008
IEEE
14 years 3 months ago
A lower-bound on the number of rankings required in recommender systems using collaborativ filtering
— We consider the situation where users rank items from a given set, and each user ranks only a (small) subset of all items. We assume that users can be classified into C classe...
Peter Marbach
AIRWEB
2007
Springer
14 years 3 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla
4OR
2005
71views more  4OR 2005»
13 years 9 months ago
On rank-perfect subclasses of near-bipartite graphs
Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet s...
Annegret Wagler
FOCS
1994
IEEE
14 years 1 months ago
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
Michael A. Bender, Donna K. Slonim