Sciweavers

185 search results - page 20 / 37
» Constructions of Grassmannian Simplices
Sort
View
COMPGEOM
2009
ACM
15 years 2 months ago
k-means requires exponentially many iterations even in the plane
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Andrea Vattani
78
Voted
SI3D
1999
ACM
15 years 2 months ago
Image-based objects
We present a compact, image-based representation for threedimensional objects with complex shapes that can be rendered with correct perspective from arbitrary viewpoints using a l...
Manuel M. Oliveira, Gary Bishop
98
Voted
CGI
2009
IEEE
15 years 2 months ago
Easy integral surfaces: a fast, quad-based stream and path surface algorithm
Despite the clear benefits that stream and path surfaces bring when visualizing 3D vector fields, their use in both industry and for research has not proliferated. This is due, in...
Tony McLoughlin, Robert S. Laramee, Eugene Zhang
HYBRID
2009
Springer
15 years 2 months ago
Trajectory Based Verification Using Local Finite-Time Invariance
Abstract. In this paper we propose a trajectory based reachability analysis by using local finite-time invariance property. Trajectory based analysis are based on the execution tra...
A. Agung Julius, George J. Pappas
ADVIS
2004
Springer
15 years 1 months ago
Temporality in Databases
Research in temporal database management has suggested that the Entity-Relationship (E-R) model lacks appropriate constructs for representing the dynamic nature of the real world....
Abdullah Uz Tansel