3020 search results - page 308 / 604 » Optimal partition trees |
185
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
185
click to vote
SPAA
1990
ACM
15 years 10 months ago
1990
ACM
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
164
click to vote
DAM
2010
15 years 6 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
144
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the weak gap property for directed graphs whose vertex set S is a metric space of size n. We prove that, if the doubling dimension of S is a constant, any directed gra...
151
click to vote
ICCS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. With the development of the multicast technology, the realtime strategy among the group applications using the multicast routing is getting more important. An essential f...