Sciweavers

2294 search results - page 309 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
148
Voted
ATAL
2010
Springer
15 years 3 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
CORR
2010
Springer
342views Education» more  CORR 2010»
14 years 12 months ago
Canonizable Partial Order Generators
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
Mateus de Oliveira Oliveira
CHI
1996
ACM
15 years 6 months ago
Silk from a Sow's Ear: Extracting Usable Structures from the Web
In its current implementation, the World-Wide Web lacks much of the explicit structure and strong typing found in many closed hypertext systems. While this property has directly f...
Peter Pirolli, James E. Pitkow, Ramana Rao
134
Voted
MSWIM
2009
ACM
15 years 9 months ago
Directional neighbor discovery in 60 GHz indoor wireless networks
The unlicensed 60 GHz band brings the promise of multi-gigabit data rates to support new applications such as high definition video over wireless links. Signal propagation in the...
Jianxia Ning, Tae-Suk Kim, Srikanth V. Krishnamurt...
CVPR
2009
IEEE
15 years 9 months ago
Tubular anisotropy for 2D vessel segmentation
In this paper, we present a new approach for segmentation of tubular structures in 2D images providing minimal interaction. The main objective is to extract centerlines and bounda...
Fethallah Benmansour, Laurent D. Cohen, Max W. K. ...