Sciweavers

5019 search results - page 3 / 1004
» On the Reflexivity of Point Sets
Sort
View
DCG
2008
132views more  DCG 2008»
13 years 5 months ago
Ehrhart Series and Lattice Triangulations
Abstract We express the generating function for lattice points in a rational polyhedral cone with a simplicial subdivision in terms of multivariate analogues of the h-polynomials o...
Sam Payne
ICSE
1997
IEEE-ACM
13 years 9 months ago
Endeavors: A Process System Infrastructure
As software projects evolve, possibly differing in size, complexity, scope, and purpose, the development processes that support the project must evolve to reflect these changes. T...
Arthur S. Hitomi, Gregory Alan Bolcer, Richard N. ...
EUSFLAT
2001
13 years 6 months ago
Similarity measurement on leaf-labelled trees
We outline a method for measuring in an efficient way an overall degree of similarity between different leaf-labelled trees. In particular, we consider rooted trees, either unorde...
Hans De Meyer, Bernard De Baets, Saskia Janssens
PAMI
2010
241views more  PAMI 2010»
13 years 5 days ago
Point Set Registration: Coherent Point Drift
We introduce Coherent Point Drift (CPD), a novel probabilistic method for nonrigid registration of point sets. The registration is treated as a Maximum Likelihood (ML) estimation ...
Andriy Myronenko, Xubo B. Song
CCCG
2009
13 years 6 months ago
Every Large Point Set contains Many Collinear Points or an Empty Pentagon
We prove the following generalised empty pentagon theorem: for every integer 2, every sufficiently large set of points in the plane contains collinear points or an empty pentagon...
Zachary Abel, Brad Ballinger, Prosenjit Bose, S&ea...