427 search results - page 27 / 86 » Computing the Local Consensus of Trees |
78
Voted
INFORMS
2008
14 years 9 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
98
Voted
ECCV
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Finding an image’s exact GPS location is a challenging computer vision problem that has many real-world applications. In this paper, we address the problem of finding ...
111
Voted
DIGITALCITIES
2003
Springer
15 years 2 months ago
2003
Springer
We have developed a digital city for Kyoto, the old capital and cultural center of Japan, as a social information infrastructure for urban everyday life including shopping, busines...
77
Voted
SIGECOM
2004
ACM
15 years 2 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
102
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...