Sciweavers

1071 search results - page 85 / 215
» Using Cell-DEVS for Modeling Complex Cell Spaces
Sort
View
CGF
2010
171views more  CGF 2010»
15 years 4 days ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
132
Voted
SIGGRAPH
2000
ACM
15 years 7 months ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
158
Voted
ICIP
2007
IEEE
16 years 5 months ago
Hierarchical Feature Fusion for Visual Tracking
A new method for object tracking in video sequences is presented. This method exploits the benefits of particle filters to tackle the multimodal distributions emerging from clutte...
Alexandros Makris, Dimitrios I. Kosmopoulos, Stavr...
132
Voted
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
15 years 5 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
SI3D
2005
ACM
15 years 9 months ago
Adaptive sampling of intersectable models exploiting image and object-space coherence
We present a sampling strategy and rendering framework for intersectable models, whose surface is implicitly defined by a black box intersection test that provides the location a...
Anders Adamson, Marc Alexa, Andrew Nealen