Sciweavers

1736 search results - page 248 / 348
» The rank-width of Directed Graphs
Sort
View
DIALM
2008
ACM
139views Algorithms» more  DIALM 2008»
15 years 6 months ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
Zeev Nutov
COLING
2008
15 years 5 months ago
Shift-Reduce Dependency DAG Parsing
Most data-driven dependency parsing approaches assume that sentence structure is represented as trees. Although trees have several desirable properties from both computational and...
Kenji Sagae, Jun-ichi Tsujii
IJCAI
2007
15 years 5 months ago
Multipotential Games
We introduce and analyze q-potential games and qcongestion games, where q is a positive integer. A 1-potential (congestion) game is a potential (congestion) game. We show that a g...
Dov Monderer
MOBIMEDIA
2007
15 years 5 months ago
Implementation aspects of a delegation system
In this paper we simulate an authorization and delegation system using knowledge based technology. This proposal is part of a visual tool that is intended to be an implementation ...
Isaac Agudo, Javier Lopez, José A. Monteneg...
UAI
2008
15 years 5 months ago
On Identifying Total Effects in the Presence of Latent Variables and Selection bias
Assume that cause-effect relationships between variables can be described as a directed acyclic graph and the corresponding linear structural equation model We consider the identi...
Manabu Kuroki, Zhihong Cai