5473 search results - page 649 / 1095 » On the graph isomorphism problem |
199
click to vote
NETWORKS
2008
15 years 6 months ago
2008
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
156
click to vote
SIAMDM
2008
15 years 6 months ago
2008
We consider the problem of assigning a numerical channel to each transmitter in a large regular array such that multiple levels of interference, which depend on the distance betwe...
178
click to vote
JAIR
2010
15 years 5 months ago
2010
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
256
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...
209
click to vote
CVPR
2001
IEEE
16 years 8 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...