Sciweavers

253 search results - page 12 / 51
» Dynamic Trees and Dynamic Point Location
Sort
View
ADMA
2006
Springer
149views Data Mining» more  ADMA 2006»
15 years 10 months ago
An Interactive Visualization Environment for Data Exploration Using Points of Interest
We present in this paper an interactive method for numeric or symbolic data visualization that allows a domain expert to extract useful knowledge and information. We propose a new ...
David Da Costa, Gilles Venturini
JACM
2010
135views more  JACM 2010»
15 years 2 months ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan
ICCV
2009
IEEE
16 years 8 months ago
Recognizing Actions by Shape-Motion Prototype Trees
A prototype-based approach is introduced for action recognition. The approach represents an action as a se- quence of prototypes for efficient and flexible action match- ing in ...
Zhe Lin, Zhuolin Jiang, Larry S. Davis
PAMI
2010
242views more  PAMI 2010»
15 years 2 months ago
Spatiotemporal Saliency in Dynamic Scenes
—A spatiotemporal saliency algorithm based on a center-surround framework is proposed. The algorithm is inspired by biological mechanisms of motion-based perceptual grouping and ...
Vijay Mahadevan, Nuno Vasconcelos
LCN
2007
IEEE
15 years 10 months ago
Investigation of IEEE 802.11k-based Access Point Coverage Area and Neighbor Discovery
— Possessing knowledge about access point coverage areas and neighbors is of essential need for the provisioning of, e.g., location based handovers or push services. A convenient...
Sven D. Hermann, Marc Emmelmann, O. Belaifa, Adam ...