317 search results - page 15 / 64 » Computing and Updating the Process Number in Trees |
121
click to vote
CVPR
2000
IEEE
16 years 1 months ago
2000
IEEE
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consum...
APAL
2007
14 years 11 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
GIS
2008
ACM
15 years 23 days ago
2008
ACM
Location-based services are increasingly popular and it is a key challenge to efficiently support query processing. We present a novel design to process large numbers of location...
133
click to vote
ICIAP
2005
ACM
15 years 5 months ago
2005
ACM
This paper shows how Markovian segmentation algorithms used to solve well known computer vision problems such as motion estimation, motion detection and stereovision can be signi...
95
Voted
ICML
2007
IEEE
16 years 15 days ago
2007
IEEE
Finite mixtures of tree-structured distributions have been shown to be efficient and effective in modeling multivariate distributions. Using Dirichlet processes, we extend this ap...