5473 search results - page 670 / 1095 » On the graph isomorphism problem |
178
click to vote
CVPR
1998
IEEE
16 years 8 months ago
1998
IEEE
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
188
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
Shape optimization is a problem which arises in numerous computer vision problems such as image segmentation and multiview reconstruction. In this paper, we focus on a certain clas...
213
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
208
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
166
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the c...