Sciweavers

37 search results - page 5 / 8
» Restricted rotation distance between binary trees
Sort
View
CVPR
2007
IEEE
15 years 11 months ago
Multiple Instance Learning of Pulmonary Embolism Detection with Geodesic Distance along Vascular Structure
We propose a novel classification approach for automatically detecting pulmonary embolism (PE) from computedtomography-angiography images. Unlike most existing approaches that req...
Jinbo Bi, Jianming Liang
125
Voted
CDC
2010
IEEE
183views Control Systems» more  CDC 2010»
14 years 4 months ago
Application of potent potential functions in eye/head movement control
In this paper we study the human eye movement and the head movement system as a simple mechanical control system. Most of the time, eye movements obey Listing's constraint, wh...
Bijoy K. Ghosh, Indika Wijayasinghe
ICALP
2009
Springer
15 years 9 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro
89
Voted
ICML
2004
IEEE
15 years 10 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
ECCV
2010
Springer
15 years 2 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...