280 search results - page 38 / 56 » Using Determining Sets to Distinguish Kneser Graphs |
PAKDD
2010
ACM
14 years 6 days ago
2010
ACM
In this work, we investigate the use of online or “crawling” algorithms to sample large social networks in order to determine the most influential or important individuals wit...
RECOMB
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
MANSCI
2007
13 years 7 months ago
2007
Selection procedures are used in a variety of applications to select the best of a finite set of alternatives. ‘Best’ is defined with respect to the largest mean, but the me...