Sciweavers

777 search results - page 12 / 156
» The Refined Process Structure Tree
Sort
View
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 2 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
ICIP
2005
IEEE
15 years 5 months ago
Object representation using colour, shape and structure criteria in a binary partition tree
Binary Partition Trees (BPTs) are a well known technique used for region-based image representation and analysis. BPTs are usually created as a result of a merging process based o...
Christian Ferran Bennström, Josep R. Casas
INFOSCALE
2007
ACM
15 years 1 months ago
SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou
TIP
2008
119views more  TIP 2008»
14 years 11 months ago
A Multistage Motion Vector Processing Method for Motion-Compensated Frame Interpolation
In this paper, a novel, low-complexity motion vector processing algorithm at the decoder is proposed for motion-compensated frame interpolation or frame rate up-conversion. We addr...
Ai-Mei Huang, T. Q. Nguyen
ICIP
2002
IEEE
16 years 1 months ago
A Bayesian approach to inferring vascular tree structure from 2D imagery
We describe a method for inferring tree-like vascular structures from 2D imagery. A Markov Chain Monte Carlo (MCMC) algorithm is employed to produce approximate samples from the p...
Abhir Bhalerao, Elke Thönnes, Roland Wilson, ...