Results 1  10
of
210
Scheduling Split Intervals
, 2002
"... We consider the problem of scheduling jobs that are given as groups of nonintersecting segments on the real line. Each job Jj is associated with an interval, Ij, which consists of up to t segments, for some t _) 1, a of their segments intersect. Such jobs show up in a I.I Problem Statement and Mo ..."
Abstract

Cited by 63 (5 self)
 Add to MetaCart
We consider the problem of scheduling jobs that are given as groups of nonintersecting segments on the real line. Each job Jj is associated with an interval, Ij, which consists of up to t segments, for some t _) 1, a of their segments intersect. Such jobs show up in a I.I Problem Statement
Maximal Length Common NonIntersecting Paths
, 1996
"... Given a set P n of n points on the plane labeled with the integers f1; : : : ; ng, an increasing path of P n is a sequence of points i 1 ! : : : ! i k such that the polygonal path obtained by connecting i j to i j+1 , j = 1; : : : ; k \Gamma 1 is nonself intersecting. We show that any point set on ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Given a set P n of n points on the plane labeled with the integers f1; : : : ; ng, an increasing path of P n is a sequence of points i 1 ! : : : ! i k such that the polygonal path obtained by connecting i j to i j+1 , j = 1; : : : ; k \Gamma 1 is nonself intersecting. We show that any point set
Nonintersecting Brownian walkers and YangMills theory on the sphere
 Nucl. Phys. B
"... We study a system of N nonintersecting Brownian motions on a line segment [0, L] with periodic, absorbing and reflecting boundary conditions. We show that the normalized reunion probabilities of these Brownian motions in the three models can be mapped to the partition function of twodimensional c ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
We study a system of N nonintersecting Brownian motions on a line segment [0, L] with periodic, absorbing and reflecting boundary conditions. We show that the normalized reunion probabilities of these Brownian motions in the three models can be mapped to the partition function of two
The REVERE Project: Experiments with the application of probabilistic NLP to Systems Engineering
 in Proceedings of 5th International Conference on Applications of Natural Language to Information Systems (NLDB'2000
, 2000
"... We investigate the number of different ways in which a rectangle containing a set of n noncorectilinear points can be partitioned into smaller rectangles by n (nonintersecting) segments, such that every point lies on a segment. We show that when the relative order of the points forms a separable pe ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We investigate the number of different ways in which a rectangle containing a set of n noncorectilinear points can be partitioned into smaller rectangles by n (nonintersecting) segments, such that every point lies on a segment. We show that when the relative order of the points forms a separable
The Study of the Longest NonIntersecting Route Problem Using SelfOrganizing Neural Networks
, 2002
"... Selforganizing neural networks have topological characteristics that can be effectively used in solving the traveling salesman problem. In this paper we propose a novel problem of maximizing the length of a nonintersecting closed route in which each node, except for the starting point, is only vis ..."
Abstract
 Add to MetaCart
Selforganizing neural networks have topological characteristics that can be effectively used in solving the traveling salesman problem. In this paper we propose a novel problem of maximizing the length of a nonintersecting closed route in which each node, except for the starting point, is only
On the number of rectangular partitions
 Proc. 15th ACMSIAM Symp. on Discrete Algorithms
, 2004
"... How many ways can a rectangle be partitioned into smaller ones? We study two variants of this problem: when the partitions are constrained to lie on n given points (no two of which are corectilinear), and when there are no such constraints and all we require is that the number of (nonintersecting) ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
How many ways can a rectangle be partitioned into smaller ones? We study two variants of this problem: when the partitions are constrained to lie on n given points (no two of which are corectilinear), and when there are no such constraints and all we require is that the number of (nonintersecting
7.1.1 Problem Statement
"... Suppose that we are given input I, a set of n nonintersecting segments inR2. A query is the triple (qx, qy, q′y) representing the vertical line segment from (qx, qy) to (qx, q′y). We wish to return a list of the segments in I that intersect with the query segment. 7.1.2 Data Structure The segment t ..."
Abstract
 Add to MetaCart
Suppose that we are given input I, a set of n nonintersecting segments inR2. A query is the triple (qx, qy, q′y) representing the vertical line segment from (qx, qy) to (qx, q′y). We wish to return a list of the segments in I that intersect with the query segment. 7.1.2 Data Structure The segment
Scheduling Split Intervals
, 2003
"... We consider the problem of scheduling jobs that are given as groups of nonintersecting segments on the real line. Each job Jj is associated with an interval, Ij, which consists of up to t segments, for some t * 1, and a positive weight, wj; two jobs are in conflict if any of their segments inters ..."
Abstract
 Add to MetaCart
We consider the problem of scheduling jobs that are given as groups of nonintersecting segments on the real line. Each job Jj is associated with an interval, Ij, which consists of up to t segments, for some t * 1, and a positive weight, wj; two jobs are in conflict if any of their segments
Image segmentation by nested cuts
 In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition
, 2000
"... We present a new image segmentation algorithm based on graph cuts. Our main tool is separation of each pixel from a special point outside the image by a cut of a minimum cost. Such a cut creates a group of pixels around each pixel. We show that these groups are either disjoint or nested in each othe ..."
Abstract

Cited by 35 (2 self)
 Add to MetaCart
if they are too small. This procedure automatically groups small components together or merges them into nearby large clusters. Effectively our segmentation is performed by extracting significant nonintersecting closed contours. We present interesting segmentation results on real and artificial images. 1
CacheOblivious RedBlue Line Segment Intersection
, 2008
"... We present an optimal cacheoblivious algorithm for finding all intersections between a set of nonintersecting red segments and a set of nonintersecting blue segments in the plane. Our algorithm uses O ( N B log M/B N B + T/B) memory transfers, where N is the total number of segments, M and B are ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We present an optimal cacheoblivious algorithm for finding all intersections between a set of nonintersecting red segments and a set of nonintersecting blue segments in the plane. Our algorithm uses O ( N B log M/B N B + T/B) memory transfers, where N is the total number of segments, M and B
Results 1  10
of
210