Results 1  10
of
6,812
Automatic Discovery of Linear Restraints Among Variables of a Program
, 1978
"... The model of abstract interpretation of programs developed by Cousot and Cousot [2nd ISOP, 1976], Cousot and Cousot [POPL 1977] and Cousot [PhD thesis 1978] is applied to the static determination of linear equality or inequality invariant relations among numerical variables of programs. ..."
Abstract

Cited by 733 (47 self)
 Add to MetaCart
The model of abstract interpretation of programs developed by Cousot and Cousot [2nd ISOP, 1976], Cousot and Cousot [POPL 1977] and Cousot [PhD thesis 1978] is applied to the static determination of linear equality or inequality invariant relations among numerical variables of programs.
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning under uncertainty, sensorbased planning, visibility, decisiontheoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.
Testing halfspaces
 IN PROC. 20TH ANNUAL SYMPOSIUM ON DISCRETE ALGORITHMS (SODA
, 2009
"... This paper addresses the problem of testing whether a Booleanvalued function f is a halfspace, i.e. a function of the form f(x) = sgn(w ·x−θ). We consider halfspaces over the continuous domain R n (endowed with the standard multivariate Gaussian distribution) as well as halfspaces over the Boolean ..."
Abstract

Cited by 34 (15 self)
 Add to MetaCart
. We prove analogous results for the Boolean cube {−1, 1} n (with Fourier coefficients in place of Hermite coefficients) for balanced halfspaces in which all degree1 Fourier coefficients are small. Dealing with general halfspaces over {−1, 1} n poses significant additional complications and requires
Replication Strategies in Unstructured PeertoPeer Networks
, 2002
"... The PeertoPeer (P2P) architectures that are most prevalent in today's Internet are decentralized and unstructured. Search is blind in that it is independent of the query and is thus not more effective than probing randomly chosen peers. One technique to improve the effectiveness of blind sear ..."
Abstract

Cited by 320 (7 self)
 Add to MetaCart
The PeertoPeer (P2P) architectures that are most prevalent in today's Internet are decentralized and unstructured. Search is blind in that it is independent of the query and is thus not more effective than probing randomly chosen peers. One technique to improve the effectiveness of blind search is to proactively replicate data.
Efficient collision detection using bounding volume hierarchies of kdops
 IEEE Transactions on Visualization and Computer Graphics
, 1998
"... Abstract—Collision detection is of paramount importance for many applications in computer graphics and visualization. Typically, the input to a collision detection algorithm is a large number of geometric objects comprising an environment, together with a set of objects moving within the environment ..."
Abstract

Cited by 289 (4 self)
 Add to MetaCart
volume hierarchies, for efficient collision detection for objects moving within highly complex environments. Our choice of bounding volume is to use a “discrete orientation polytope” (“kdop”), a convex polytope whose facets are determined by halfspaces whose outward normals come from a small fixed set of k
Radar Interferometry and its application to changes in the Earth’s surface." Reviews of Geophysics 36(4
, 1998
"... Abstract. Geophysical applications of radar interferometry to measure changes in the Earth’s surface have exploded in the early 1990s. This new geodetic technique calculates the interference pattern caused by the difference in phase between two images acquired by a spaceborne synthetic aperture rad ..."
Abstract

Cited by 286 (5 self)
 Add to MetaCart
Abstract. Geophysical applications of radar interferometry to measure changes in the Earth’s surface have exploded in the early 1990s. This new geodetic technique calculates the interference pattern caused by the difference in phase between two images acquired by a spaceborne synthetic aperture radar at two distinct times. The resulting interferogram is a contour map of the change in distance between the ground and the radar instrument. These maps provide an unsurpassed spatial sampling density (;100 pixels km22), a competitive precision (;1 cm), and a useful observation cadence (1 pass month21). They record movements in the crust, perturbations in the atmosphere, dielectric modifications in the soil, and relief in the topography. They are also sensitive to technical effects, such as relative variations in the
The Power Crust
, 2001
"... The power crust is a construction which takes a sample of points from the surface of a threedimensional object and produces a surface mesh and an approximate medial axis. The approach is to first approximate the medial axis transform (MAT) of the object. We then use an inverse transform to produce ..."
Abstract

Cited by 266 (7 self)
 Add to MetaCart
The power crust is a construction which takes a sample of points from the surface of a threedimensional object and produces a surface mesh and an approximate medial axis. The approach is to first approximate the medial axis transform (MAT) of the object. We then use an inverse transform to produce the surface representation from the MAT.
Feature Selection via Concave Minimization and Support Vector Machines
 Machine Learning Proceedings of the Fifteenth International Conference(ICML ’98
, 1998
"... Computational comparison is made between two feature selection approaches for finding a separating plane that discriminates between two point sets in an ndimensional feature space that utilizes as few of the n features (dimensions) as possible. In the concave minimization approach [19, 5] a separat ..."
Abstract

Cited by 259 (23 self)
 Add to MetaCart
Computational comparison is made between two feature selection approaches for finding a separating plane that discriminates between two point sets in an ndimensional feature space that utilizes as few of the n features (dimensions) as possible. In the concave minimization approach [19, 5] a separating plane is generated by minimizing a weighted sum of distances of misclassified points to two parallel planes that bound the sets and which determine the separating plane midway between them. Furthermore, the number of dimensions of the space used to determine the plane is minimized. In the support vector machine approach [27, 7, 1, 10, 24, 28], in addition to minimizing the weighted sum of distances of misclassified points to the bounding planes, we also maximize the distance between the two bounding planes that generate the separating plane. Computational results show that feature suppression is an indirect consequence of the support vector machine approach when an appropriate norm is us...
Testing (Subclasses of) Halfspaces
, 2010
"... The purpose of this document is to summarize the talk I gave at the property testing workshop at ITCS in January 2010 or more accurately, the talk I would have given, had I not been sick with the flu. In my absence, Rocco Servedio actually gave the talk. Here I will attempt to summarize what I woul ..."
Abstract
 Add to MetaCart
The purpose of this document is to summarize the talk I gave at the property testing workshop at ITCS in January 2010 or more accurately, the talk I would have given, had I not been sick with the flu. In my absence, Rocco Servedio actually gave the talk. Here I will attempt to summarize what I would have said, or what Rocco might have said, or some combination of the two.
Results 1  10
of
6,812