Sciweavers

2553 search results - page 44 / 511
» Modeling Trees with Hypertextures
Sort
View
MT
2010
100views more  MT 2010»
14 years 8 months ago
Exploiting syntactic relationships in a phrase-based decoder: an exploration
Phrase-based decoding is conceptually simple and straightforward to implement, at the cost of drastically oversimplified reordering models. Syntactically aware models make it pos...
Tim Hunter, Philip Resnik
APPROX
2010
Springer
150views Algorithms» more  APPROX 2010»
14 years 10 months ago
Reconstruction Threshold for the Hardcore Model
In this paper we consider the reconstruction problem on the tree for the hardcore model. We determine new bounds for the non-reconstruction regime on the k-regular tree showing non...
Nayantara Bhatnagar, Allan Sly, Prasad Tetali
COMCOM
2006
81views more  COMCOM 2006»
14 years 9 months ago
A case for tree evolution in QoS multicasting
The phenomenal growth of group communications and QoS-aware applications over the Internet have accelerated the development of multicasting technologies. The Core-Based Tree (CBT) ...
Anirban Chakrabarti, G. Manimaran
SODA
1997
ACM
106views Algorithms» more  SODA 1997»
14 years 11 months ago
Optimal Bounds for Matching Routing on Trees
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
Louxin Zhang
ESANN
2003
14 years 11 months ago
Neural Networks and M5 model trees in modeling water level-discharge relationship for an Indian river
: In flood management it is important to reliably estimate the discharge in a river. Hydrologists use historic data to establish a rating curve – a relationship between the water...
Biswanath Bhattacharya, Dimitri P. Solomatine