Sciweavers

364 search results - page 16 / 73
» A benchmark for the sorting network problem
Sort
View
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
13 years 10 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
CN
2010
107views more  CN 2010»
13 years 5 months ago
Secure multicast in IPTV services
Technological evolution is leading telecommunications to all-IP networks where multiple services are transported as IP packets. Among these are the group communications services w...
António Pinto, Manuel Ricardo
ESANN
2006
13 years 8 months ago
Optimal design of hierarchical wavelet networks for time-series forecasting
The purpose of this study is to identify the Hierarchical Wavelet Neural Networks (HWNN) and select important input features for each sub-wavelet neural network automatically. Base...
Yuehui Chen, Bo Yang, Ajith Abraham
IWANN
2009
Springer
14 years 1 months ago
A Genetic Algorithm for ANN Design, Training and Simplification
This paper proposes a new evolutionary method for generating ANNs. In this method, a simple real-number string is used to codify both architecture and weights of the networks. Ther...
Daniel Rivero, Julian Dorado, Enrique Ferná...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 6 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang