Sciweavers

2322 search results - page 46 / 465
» On a game in directed graphs
Sort
View
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
14 years 10 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani
ICB
2007
Springer
163views Biometrics» more  ICB 2007»
15 years 6 months ago
Palmprint Recognition Based on Directional Features and Graph Matching
Palmprint recognition, as a reliable personal identity check method, has been receiving increasing attention during recent years. According to previous work, local texture analysis...
Yufei Han, Tieniu Tan, Zhenan Sun
IPPS
2006
IEEE
15 years 5 months ago
Parallel FPGA-based all-pairs shortest-paths in a directed graph
With rapid advances in VLSI technology, Field Programmable Gate Arrays (FPGAs) are receiving the attention of the Parallel and High Performance Computing community. In this paper,...
Uday Bondhugula, Ananth Devulapalli, Joseph Fernan...
JMLR
2008
108views more  JMLR 2008»
14 years 12 months ago
A Recursive Method for Structural Learning of Directed Acyclic Graphs
In this paper, we propose a recursive method for structural learning of directed acyclic graphs (DAGs), in which a problem of structural learning for a large DAG is first decompos...
Xianchao Xie, Zhi Geng
CIKM
2004
Springer
15 years 5 months 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