427 search results - page 52 / 86 » Computing the Local Consensus of Trees |
159
Voted
CIVR
2009
Springer
15 years 11 months ago
2009
Springer
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
134
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
This paper addresses the problem of detecting and segmenting partially occluded objects of a known category. We first define a part labelling which densely covers the object. Our ...
144
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
134
click to vote
GC
2004
Springer
15 years 10 months ago
2004
Springer
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
169
click to vote
ICNP
1999
IEEE
15 years 8 months ago
1999
IEEE
While the IP unicast service has proven successful, extending end-to-end adaptation to multicast has been a difficult problem. Unlike the unicast case, multicast protocols must su...