Results 1  10
of
352
Efficient graphbased image segmentation.
 International Journal of Computer Vision,
, 2004
"... Abstract. This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graphbased representation of the image. We then develop an efficient segmentation algorithm based on this predicate, and show ..."
Abstract

Cited by 940 (1 self)
 Add to MetaCart
Abstract. This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graphbased representation of the image. We then develop an efficient segmentation algorithm based on this predicate, and show
An efficient algorithm for the nearly equitable . . .
, 2008
"... An edge coloring of a multigraph is nearly equitable if, among the edges incident to each vertex, the numbers of edges colored with any two colors differ by at most two. It has been proved that the problem of finding a nearly equitable edge coloring can be solved in O(m 2 /k) time, where m and k are ..."
Abstract
 Add to MetaCart
An edge coloring of a multigraph is nearly equitable if, among the edges incident to each vertex, the numbers of edges colored with any two colors differ by at most two. It has been proved that the problem of finding a nearly equitable edge coloring can be solved in O(m 2 /k) time, where m and k
Comparing Images Using the Hausdorff Distance
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1993
"... The Hausdorff distance measures the extent to which each point of a `model' set lies near some point of an `image' set and vice versa. Thus this distance can be used to determine the degree of resemblance between two objects that are superimposed on one another. In this paper we provide ef ..."
Abstract

Cited by 659 (10 self)
 Add to MetaCart
efficient algorithms for computing the Hausdorff distance between all possible relative positions of a binary image and a model. We focus primarily on the case in which the model is only allowed to translate with respect to the image. Then we consider how to extend the techniques to rigid motion
Property Testing and its connection to Learning and Approximation
"... We study the question of determining whether an unknown function has a particular property or is fflfar from any function with that property. A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the fun ..."
Abstract

Cited by 475 (67 self)
 Add to MetaCart
the function on instances of its choice. First, we establish some connections between property testing and problems in learning theory. Next, we focus on testing graph properties, and devise algorithms to test whether a graph has properties such as being kcolorable or having a aeclique (clique of density ae
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
, 2009
"... We discuss the nearly equitable edge coloring problem on a multigraph and propose an ecient algorithm for solving the problem, which has a better time complexity than the previous algorithms. The coloring computed by our algorithm satises additional balanced conditions on the number of edges used in ..."
Abstract
 Add to MetaCart
We discuss the nearly equitable edge coloring problem on a multigraph and propose an ecient algorithm for solving the problem, which has a better time complexity than the previous algorithms. The coloring computed by our algorithm satises additional balanced conditions on the number of edges used
Efficient Testing of Large Graphs
 Combinatorica
"... Let P be a property of graphs. An test for P is a randomized algorithm which, given the ability to make queries whether a desired pair of vertices of an input graph G with n vertices are adjacent or not, distinguishes, with high probability, between the case of G satisfying P and the case that it h ..."
Abstract

Cited by 176 (47 self)
 Add to MetaCart
properties admit an test. In this paper we make a first step towards a logical characterization of all testable graph properties, and show that properties describable by a very general type of coloring problem are testable. We use this theorem to prove that first order graph properties not containing a
On Algorithms for Efficient Data Migration
, 2001
"... The data migration problem is the problem of computing an efficient plan for moving data stored on devices in a network from one configuration to another. Load balancing or changing usage patterns could necessitate such a rearrangement of data. In this paper, we consider the case where the objects a ..."
Abstract

Cited by 45 (3 self)
 Add to MetaCart
are fixedsize and the network is complete. The direct migration problem is closely related to edgecoloring. However, because there are space constraints on the devices, the problem is more complex. Our main results are polynomial time algorithms for finding a nearoptimal migration plan in the presence
Analysis of an edge coloring algorithm using Chernoff bounds
 Information Technology Letters
"... Given a multigraph G = (V,E) with n vertices andm edges and a color set C = {1, 2,..., k}, the nearly equitable edge coloring is an assignment of given colors to edges in G such that, among the edges incident to each vertex, the num ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Given a multigraph G = (V,E) with n vertices andm edges and a color set C = {1, 2,..., k}, the nearly equitable edge coloring is an assignment of given colors to edges in G such that, among the edges incident to each vertex, the num
Spectral Partitioning of Random Graphs
, 2001
"... Problems such as bisection, graph coloring, and clique are generally believed hard in the worst case. However, they can be solved if the input data is drawn randomly from a distribution over graphs containing acceptable solutions. In this paper we show that a simple spectral algorithm can solve all ..."
Abstract

Cited by 165 (3 self)
 Add to MetaCart
Problems such as bisection, graph coloring, and clique are generally believed hard in the worst case. However, they can be solved if the input data is drawn randomly from a distribution over graphs containing acceptable solutions. In this paper we show that a simple spectral algorithm can solve all
Backtracking Based Iterated Tabu Search for Equitable Coloring
, 2015
"... An equitable kcoloring of an undirected graph G = (V,E) is a partition of its vertices into k disjoint independent sets, such that the cardinalities of any two independent sets differ by at most one. As a variant of the graph coloring problem (GCP), the equitable coloring problem (ECP) concerns fi ..."
Abstract
 Add to MetaCart
An equitable kcoloring of an undirected graph G = (V,E) is a partition of its vertices into k disjoint independent sets, such that the cardinalities of any two independent sets differ by at most one. As a variant of the graph coloring problem (GCP), the equitable coloring problem (ECP) concerns
Results 1  10
of
352