668 search results - page 59 / 134 » Algorithmics and Applications of Tree and Graph Searching |
155
Voted
CORR
2012
Springer
13 years 10 months ago
2012
Springer
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
155
click to vote
COMPGEOM
2008
ACM
15 years 4 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
165
Voted
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
124
Voted
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— In wireless ad hoc networks (WANETs), e.g. wireless sensor networks, battery-powered devices are constrained by limited amount of energy. Many WANET applications require that t...
131
click to vote
BNCOD
2004
15 years 3 months ago
2004
Abstract. We present a new application for keyword search within relational databases, which uses a novel algorithm to solve the join discovery problem by finding Memex-like trails...