Sciweavers

2322 search results - page 119 / 465
» On a game in directed graphs
Sort
View
CORR
2004
Springer
121views Education» more  CORR 2004»
15 years 6 months ago
A measure of similarity between graph vertices
We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with, respectively, nA and nB vertices. We define an nB
Vincent D. Blondel, Anahí Gajardo, Maureen ...
VIP
2000
15 years 7 months ago
A System for Graph Clustering Based on User Hints
This paper presents a system for graph clustering where users can visualize the clustering and give "hints" that help a computing method to find better solutions. Hints ...
Hugo A. D. do Nascimento, Peter Eades
CORR
2011
Springer
159views Education» more  CORR 2011»
15 years 1 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
ICDM
2009
IEEE
139views Data Mining» more  ICDM 2009»
15 years 4 months ago
Frequent Pattern Discovery from a Single Graph with Quantitative Itemsets
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
Yuuki Miyoshi, Tomonobu Ozaki, Takenao Ohkawa
CHI
2006
ACM
16 years 6 months ago
Exploring user experience in "blended reality": moving interactions out of the screen
Video game players often learn to map their physical actions (e.g., pressing buttons) onto their on-screen avatars' actions (e.g., wielding swords) in order to play. We explo...
David F. Huynh, Yan Xu, Shuo Wang