Sciweavers

801 search results - page 70 / 161
» Minimal Locked Trees
Sort
View
ICASSP
2009
IEEE
15 years 4 months ago
Tree configuration games for distributed stream mining systems
We consider the problem of configuring classifier trees in distributed stream mining system. The configuration involves selecting appropriate false-alarm detection tradeoffs for e...
Hyunggon Park, Deepak S. Turaga, Olivier Verscheur...
CVPR
2011
IEEE
15 years 1 months ago
Novel 4-D Open-Curve Active Contour and Curve Completion Approach for Automated Tree Structure Extraction
We present novel approaches for fully automated extraction of tree-like tubular structures from 3-D image stacks. A 4-D Open-Curve Active Contour (Snake) model is proposed for sim...
Yu Wang, Arunachalam Narayanaswamy, Badri Roysam
CORR
2011
Springer
169views Education» more  CORR 2011»
15 years 1 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
IS
2011
14 years 10 months ago
Collection trees for event-monitoring queries
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
Antonios Deligiannakis, Yannis Kotidis, Vassilis S...
INFOCOM
2012
IEEE
13 years 8 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai