2137 search results - page 286 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
147
click to vote
ICCV
2003
IEEE
16 years 7 months ago
2003
IEEE
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
156
click to vote
SIAMDM
2010
14 years 12 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
160
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
133
click to vote
MOBIHOC
2006
ACM
16 years 4 months ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
158
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...