Sciweavers

807 search results - page 30 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
134
Voted
GLOBECOM
2007
IEEE
15 years 10 months ago
Centralized Scheduling Tree Construction Under Multi-Channel IEEE 802.16 Mesh Networks
—This paper focuses on routing tree construction problem and its influence on the performance of utilizing centralized scheduling in IEEE 802.16 mesh networks. We apply three rou...
Wenhua Jiao, Pin Jiang, Ruoju Liu, Ming Li
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 8 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
ECAI
2006
Springer
15 years 7 months ago
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
Radu Marinescu 0002, Rina Dechter
170
Voted
JGTOOLS
2006
199views more  JGTOOLS 2006»
15 years 4 months ago
Fast Approximation of High-Order Voronoi Diagrams and Distance Transforms on the GPU
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
Ian Fischer, Craig Gotsman
DEXA
2008
Springer
155views Database» more  DEXA 2008»
15 years 5 months ago
NM-Tree: Flexible Approximate Similarity Search in Metric and Non-metric Spaces
So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric...
Tomás Skopal, Jakub Lokoc