Sciweavers

87 search results - page 4 / 18
» Dynamic Maximum Tree Depth
Sort
View
AAAI
1996
14 years 5 days ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
AAAI
2007
14 years 1 months ago
Dynamic DFS Tree in ADOPT-ing
Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is po...
Marius-Calin Silaghi, Makoto Yokoo
ICIP
2007
IEEE
15 years 16 days ago
Rate-Distortion Optimal Depth Maps in the Wavelet Domain for Free-Viewpoint Rendering
We consider the problem of estimating and encoding depth maps from multiple views in the context of 3D-TV with free-viewpoint rendering. We propose a novel codec based on the Rate...
Matthieu Maitre, Yoshihisa Shinagawa, Minh N. Do
CCECE
2006
IEEE
14 years 4 months ago
Dynamic and Parallel Approaches to Optimal Evolutionary Tree Construction
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
Anupam Bhattacharjee, Kazi Zakia Sultana, Zalia Sh...
PERCOM
2008
ACM
14 years 10 months ago
Topology Formation in IEEE 802.15.4: Cluster-Tree Characterization
The IEEE 802.15.4 standard defines a set of procedures to set-up a Low-Rate Wireless Personal Area Network where nodes self-organize into a logical communication structure through ...
Francesca Cuomo, Sara Della Luna, Petia Todorova, ...