Sciweavers

4047 search results - page 522 / 810
» The Discrete Basis Problem
Sort
View
143
Voted
COMPGEOM
2004
ACM
15 years 10 months ago
An empirical comparison of techniques for updating Delaunay triangulations
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
Leonidas J. Guibas, Daniel Russel
140
Voted
COMPGEOM
2004
ACM
15 years 10 months ago
On empty convex polygons in a planar point set
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
Rom Pinchasi, Rados Radoicic, Micha Sharir
IDEAL
2004
Springer
15 years 10 months ago
Cosine Transform Priors for Enhanced Decoding of Compressed Images
Abstract. Image compression methods such as JPEG use quantisation of discrete cosine transform (DCT) coefficients of image blocks to produce lossy compression. During decoding, an...
Amos J. Storkey, Michael Allan
STACS
2004
Springer
15 years 10 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
HICSS
2003
IEEE
139views Biometrics» more  HICSS 2003»
15 years 10 months ago
Modeling of information dominance in complex systems: A system partitioning and hybrid control framework
This paper1 provides a view of modeling the information dominance problem of military systems as representative of modeling other complex systems. The ideas are an extension of ea...
John R. James