16430 search results - page 344 / 3286 » On Computable Tree Functions |
158
click to vote
SODA
1998
ACM
15 years 6 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
162
click to vote
AAMAS
2012
Springer
14 years 24 days ago
2012
Springer
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
161
click to vote
SIGECOM
2006
ACM
15 years 11 months ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
156
click to vote
ICCV
2007
IEEE
16 years 7 months ago
2007
IEEE
Models of activity structure for unconstrained environments are generally not available a priori. Recent representational approaches to this end are limited by their computational...
169
click to vote
WEA
2010
Springer
15 years 12 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...