Results 1  10
of
2,553,048
Generalized selfapproaching curves
 IN PROC. 9TH ANNU. INTERNAT. SYMPOS. ALGORITHMS COMPUT., VOLUME 1533 OF LECTURE NOTES COMPUT. SCI
, 1998
"... We consider all planar oriented curves that have the following property depending on a fixed angle ϕ. ForeachpointB on the curve, the rest of the curve lies inside a wedge of angle ϕ with apex in B. This property restrains the curve’s meandering, and for ϕ ≤ π 2 this means that a point running alon ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
We consider all planar oriented curves that have the following property depending on a fixed angle ϕ. ForeachpointB on the curve, the rest of the curve lies inside a wedge of angle ϕ with apex in B. This property restrains the curve’s meandering, and for ϕ ≤ π 2 this means that a point running
SelfApproaching Graphs
"... Abstract. In this paper we introduce selfapproaching graph drawings. A straightline drawing of a graph is selfapproaching if, for any origin vertex s and any destination vertex t, there is an stpath in the graph such that, for any point q on the path, as a point p moves continuously along the pa ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. In this paper we introduce selfapproaching graph drawings. A straightline drawing of a graph is selfapproaching if, for any origin vertex s and any destination vertex t, there is an stpath in the graph such that, for any point q on the path, as a point p moves continuously along
The irreducibility of the space of curves of given genus
 Publ. Math. IHES
, 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~ ..."
Abstract

Cited by 512 (2 self)
 Add to MetaCart
Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k
SelfApproaching Curves
 Math. Proc. Camb. Phil. Soc
, 1995
"... We present a new class of curves which are selfapproaching in the following sense. For any three consecutive points a, b, c on the curve the point b is closer to c than a to c. This is a generalisation of curves with increasing chords which are selfapproaching in both directions. We show a tigh ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
We present a new class of curves which are selfapproaching in the following sense. For any three consecutive points a, b, c on the curve the point b is closer to c than a to c. This is a generalisation of curves with increasing chords which are selfapproaching in both directions. We show a
Axiomatic quantum field theory in curved spacetime
, 2008
"... The usual formulations of quantum field theory in Minkowski spacetime make crucial use of features—such as Poincare invariance and the existence of a preferred vacuum state—that are very special to Minkowski spacetime. In order to generalize the formulation of quantum field theory to arbitrary globa ..."
Abstract

Cited by 692 (18 self)
 Add to MetaCart
The usual formulations of quantum field theory in Minkowski spacetime make crucial use of features—such as Poincare invariance and the existence of a preferred vacuum state—that are very special to Minkowski spacetime. In order to generalize the formulation of quantum field theory to arbitrary
Iterative point matching for registration of freeform curves and surfaces
, 1994
"... A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract

Cited by 659 (7 self)
 Add to MetaCart
A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately
Mining Generalized Association Rules
, 1995
"... We introduce the problem of mining generalized association rules. Given a large database of transactions, where each transaction consists of a set of items, and a taxonomy (isa hierarchy) on the items, we find associations between items at any level of the taxonomy. For example, given a taxonomy th ..."
Abstract

Cited by 577 (7 self)
 Add to MetaCart
We introduce the problem of mining generalized association rules. Given a large database of transactions, where each transaction consists of a set of items, and a taxonomy (isa hierarchy) on the items, we find associations between items at any level of the taxonomy. For example, given a taxonomy
The use of the area under the ROC curve in the evaluation of machine learning algorithms
 Pattern Recognition
, 1997
"... AbstractIn this paper we investigate the use of the area under the receiver operating characteristic (ROC) curve (AUC) as a performance measure for machine learning algorithms. As a case study we evaluate six machine learning algorithms (C4.5, Multiscale Classifier, Perceptron, Multilayer Percept ..."
Abstract

Cited by 664 (3 self)
 Add to MetaCart
AbstractIn this paper we investigate the use of the area under the receiver operating characteristic (ROC) curve (AUC) as a performance measure for machine learning algorithms. As a case study we evaluate six machine learning algorithms (C4.5, Multiscale Classifier, Perceptron, Multi
A survey of generalpurpose computation on graphics hardware
, 2007
"... The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware acompelling platform for computationally demanding tasks in awide variety of application domains. In this report, we describe, summarize, and analyze the l ..."
Abstract

Cited by 545 (18 self)
 Add to MetaCart
the latest research in mapping generalpurpose computation to graphics hardware. We begin with the technical motivations that underlie generalpurpose computation on graphics processors (GPGPU) and describe the hardware and software developments that have led to the recent interest in this field. We then aim
Results 1  10
of
2,553,048