199 search results - page 22 / 40 » Fast Algorithms for Computing Tree LCS |
128
Voted
ICC
2009
IEEE
15 years 9 months ago
2009
IEEE
—The connected dominating set (CDS) has been commonly used for routing and broadcast in mobile ad hoc networks (MANETs). Considering the applications of MANETs, it is generally p...
111
Voted
FOCS
1989
IEEE
15 years 6 months ago
1989
IEEE
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
118
click to vote
CGI
2004
IEEE
15 years 6 months ago
2004
IEEE
This paper describes a new method for generating surfaces of branching tubular structures with given centerlines and radii. As the centerlines are not straight lines, the cross-se...
139
click to vote
EGH
2010
Springer
15 years 12 days ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
168
Voted
CVIU
2011
14 years 5 months ago
2011
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...