2137 search results - page 330 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
120
Voted
CIKM
2004
Springer
15 years 8 months ago
2004
Springer
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 ...
146
click to vote
ECCV
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. We present a novel algorithm for performing integrated segmentation and 3D pose estimation of a human body from multiple views. Unlike other related state of the art tech...
159
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
145
Voted
ICCAD
1999
IEEE
15 years 7 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
121
Voted
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...