Sciweavers

222 search results - page 15 / 45
» Tracking Information Flow in Dynamic Tree Structures
Sort
View
SODA
2001
ACM
144views Algorithms» more  SODA 2001»
13 years 9 months ago
Representing dynamic binary trees succinctly
We introduce a new updatable representation ofbinary trees. The structure requires the information theoretic minimum 2n + o(n) bits and supports basic navigational operations in c...
J. Ian Munro, Venkatesh Raman, Adam J. Storm
CIKM
2008
Springer
13 years 9 months ago
Efficient frequent pattern mining over data streams
This paper proposes a prefix-tree structure, called CPS-tree (Compact Pattern Stream tree) that efficiently discovers the exact set of recent frequent patterns from high-speed dat...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...
ICIP
2003
IEEE
14 years 9 months ago
Estimation of cardiac phases in echographic images using multiple models
This paper presents an algorithm for tracking the left ventricle in echocardiographic sequences, using multiple models. The use of multiple dynamic models is appropriate since the...
Jacinto C. Nascimento, Jorge S. Marques, Joã...
AROBOTS
2008
104views more  AROBOTS 2008»
13 years 7 months ago
Modeling dynamic scenarios for local sensor-based motion planning
This paper addresses the modeling of the static and dynamic parts of the scenario and how to use this information with a sensor-based motion planning system. The contribution in th...
Luis Montesano, Javier Minguez, Luis Montano
GLOBECOM
2009
IEEE
14 years 2 months ago
Information Dissemination Control for Cooperative Active Safety Applications in Vehicular Ad-Hoc Networks
Abstract—Vehicular Ad-Hoc networks (VANETs) play a critical role in enabling important active safety applications such as collision warning and vehicle tracking. The most pressin...
Ching-Ling Huang, Yaser P. Fallah, Raja Sengupta, ...