Sciweavers

4894 search results - page 709 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
TNN
2008
177views more  TNN 2008»
13 years 8 months ago
Adaptive Importance Sampling to Accelerate Training of a Neural Probabilistic Language Model
Previous work on statistical language modeling has shown that it is possible to train a feed-forward neural network to approximate probabilities over sequences of words, resulting...
Yoshua Bengio, Jean-Sébastien Senecal
TON
2008
133views more  TON 2008»
13 years 8 months ago
Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks
An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data ...
Cunqing Hua, Tak-Shing Peter Yum
TSMC
2008
122views more  TSMC 2008»
13 years 8 months ago
A Geometric Approach to the Theory of Evidence
In this paper, we propose a geometric approach to the theory of evidence based on convex geometric interpretations of its two key notions of belief function (b.f.) and Dempster...
Fabio Cuzzolin
TSP
2008
178views more  TSP 2008»
13 years 8 months ago
Digital Computation of Linear Canonical Transforms
Abstract--We deal with the problem of efficient and accurate digital computation of the samples of the linear canonical transform (LCT) of a function, from the samples of the origi...
A. Koc, Haldun M. Özaktas, Cagatay Candan, M....
JWSR
2007
89views more  JWSR 2007»
13 years 8 months ago
Fully Automated Web Services Discovery and Composition Through Concept Covering and Concept Abduction
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...