2137 search results - page 304 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
131
click to vote
CN
2007
15 years 5 months ago
2007
Web masters usually place certain web pages such as home pages and index pages in front of others. Under such a design, it is necessary to go through some pages to reach the desti...
171
click to vote
HPCC
2011
Springer
14 years 4 months ago
2011
Springer
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
115
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
The paper studies the problem of distributed static parameter (vector) estimation in sensor networks with nonlinear observation models and imperfect inter-sensor communication. We...
165
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
154
click to vote
CVPR
2004
IEEE
16 years 7 months ago
2004
IEEE
Traditionally, the problem of stereo matching has been addressed either by a local window-based approach or a dense pixel-based approach using global optimization. In this paper, ...