Results 1  10
of
3,334
New vertex reconstruction algorithms for CMS
, 2003
"... The reconstruction of interaction vertices can be decomposed into a pattern recognition problem (“vertex finding”) and a statistical problem (“vertex fitting”). We briefly review classical methods. We introduce novel approaches and motivate them in the framework of highluminosity experiments like a ..."
Abstract
 Add to MetaCart
The reconstruction of interaction vertices can be decomposed into a pattern recognition problem (“vertex finding”) and a statistical problem (“vertex fitting”). We briefly review classical methods. We introduce novel approaches and motivate them in the framework of highluminosity experiments like
A new approach to the maximum flow problem
 JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract

Cited by 672 (33 self)
 Add to MetaCart
on the preflow concept of Karzanov is introduced. A preflow is like a flow, except that the total amount flowing into a vertex is allowed to exceed the total amount flowing out. The method maintains a preflow in the original network and pushes local flow excess toward the sink along what are estimated
A Signal Processing Approach To Fair Surface Design
, 1995
"... In this paper we describe a new tool for interactive freeform fair surface design. By generalizing classical discrete Fourier analysis to twodimensional discrete surface signals  functions defined on polyhedral surfaces of arbitrary topology , we reduce the problem of surface smoothing, or fai ..."
Abstract

Cited by 654 (15 self)
 Add to MetaCart
In this paper we describe a new tool for interactive freeform fair surface design. By generalizing classical discrete Fourier analysis to twodimensional discrete surface signals  functions defined on polyhedral surfaces of arbitrary topology , we reduce the problem of surface smoothing
A New Vertex Splitting Algorithm for Cograph Recognition
, 2000
"... This paper shows how the complexity of this new algorithm can be improved down to linear time. Fortunately the algorithm keeps its simplicity. It is based on the powerfull paradigm of partition renement and vertex splitting. And so can be included in a wide pool of graphs algorithms such as modular ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper shows how the complexity of this new algorithm can be improved down to linear time. Fortunately the algorithm keeps its simplicity. It is based on the powerfull paradigm of partition renement and vertex splitting. And so can be included in a wide pool of graphs algorithms
A new vertex result for robustness problems with interval matrix uncertainty
 Systems & Control Letters
"... Abstract This paper 1 addresses a family of robustness problems in which the system under consideration is affected by interval matrix uncertainty. The main contribution of the paper is a new vertex result that drastically reduces the number of extreme realizations required to check robust feasibil ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract This paper 1 addresses a family of robustness problems in which the system under consideration is affected by interval matrix uncertainty. The main contribution of the paper is a new vertex result that drastically reduces the number of extreme realizations required to check robust
ReTiling Polygonal Surfaces
 Computer Graphics
, 1992
"... This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at various levels of detail is important for achieving high frame rates in interactive graphics applications and also for speed ..."
Abstract

Cited by 445 (3 self)
 Add to MetaCart
model and the new points that are to become vertices in the retiled surface. The new model is then created by removing each original vertex and locally retriangulating the surface in a way that matches the local connectedness of the initial surface. This technique for surface retessellation has been
www.elsevier.com/locate/sysconle A new vertex result for robustness problems with interval matrix uncertainty
, 2007
"... This paper1 addresses a family of robustness problems in which the system under consideration is affected by interval matrix uncertainty. The main contribution of the paper is a new vertex result that drastically reduces the number of extreme realizations required to check robust feasibility. This v ..."
Abstract
 Add to MetaCart
This paper1 addresses a family of robustness problems in which the system under consideration is affected by interval matrix uncertainty. The main contribution of the paper is a new vertex result that drastically reduces the number of extreme realizations required to check robust feasibility
A Data Structure for Dynamic Trees
, 1983
"... A data structure is proposed to maintain a collection of vertexdisjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n) ti ..."
Abstract

Cited by 347 (21 self)
 Add to MetaCart
A data structure is proposed to maintain a collection of vertexdisjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n
A NEW VERTEX COLORING ALGORITHM BASED ON VARIABLE ACTIONSET LEARNING AUTOMATA
"... Abstract. In this paper, we propose a learning automatabased iterative algorithm for approximating a near optimal solution to the vertex coloring problem. Vertex coloring is a wellknown NPhard optimization problem in graph theory in which each vertex is assigned a color so that no two adjacent ve ..."
Abstract

Cited by 16 (7 self)
 Add to MetaCart
Abstract. In this paper, we propose a learning automatabased iterative algorithm for approximating a near optimal solution to the vertex coloring problem. Vertex coloring is a wellknown NPhard optimization problem in graph theory in which each vertex is assigned a color so that no two adjacent
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
, 1990
"... We present a new piv otbased algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration of the vertices of an arrangement or of a convex polyhedron, in arbitrary dimension. The algorithm has the following prope ..."
Abstract

Cited by 223 (29 self)
 Add to MetaCart
We present a new piv otbased algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration of the vertices of an arrangement or of a convex polyhedron, in arbitrary dimension. The algorithm has the following
Results 1  10
of
3,334