Sciweavers

4761 search results - page 65 / 953
» Generalizing Boundary Points
Sort
View
FPL
2006
Springer
125views Hardware» more  FPL 2006»
13 years 11 months ago
Application-Specific Memory Interleaving for FPGA-Based Grid Computations: A General Design Technique
Many compute-intensive applications generate single result values by accessing clusters of nearby points in grids of one, two, or more dimensions. Often, the performance of FGPA i...
Tom Van Court, Martin C. Herbordt
IWCIA
2004
Springer
14 years 1 months ago
An Efficient Euclidean Distance Transform
Within image analysis the distance transform has many applications. The distance transform measures the distance of each object point from the nearest boundary. For ease of computa...
Donald G. Bailey
COMPGEOM
1996
ACM
14 years 8 days ago
Flipping Edges in Triangulations
A triangulation of a point set Pn is a partitioning of the convex hull Conv(Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn...
Ferran Hurtado, Marc Noy, Jorge Urrutia
EACL
2006
ACL Anthology
13 years 9 months ago
Automatic Segmentation of Multiparty Dialogue
In this paper, we investigate the problem of automatically predicting segment boundaries in spoken multiparty dialogue. We extend prior work in two ways. We first apply approaches...
Pei-yun Hsueh, Johanna D. Moore, Steve Renals
CVPR
1999
IEEE
14 years 10 months ago
On the Intrinsic Reconstruction of Shape from its Symmetries
The main question we address is: what is the minimal information required to generate closed, non-intersecting planar boundaries? For this paper we restrict ‘shape’ to this mea...
Peter J. Giblin, Benjamin B. Kimia