Sciweavers

2262 search results - page 63 / 453
» Challenging Applications on Fast Networks
Sort
View
ESANN
2003
13 years 11 months ago
Fast approximation of the bootstrap for model selection
The bootstrap resampling method may be efficiently used to estimate the generalization error of a family of nonlinear regression models, as artificial neural networks. The main dif...
Geoffroy Simon, Amaury Lendasse, Vincent Wertz, Mi...
JPDC
2006
134views more  JPDC 2006»
13 years 10 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
ISCC
1999
IEEE
111views Communications» more  ISCC 1999»
14 years 2 months ago
Towards TCP-Friendly Adaptive Multimedia Applications Based on RTP
For multimedia senders to benefit the most of dynamically changing availability of network resources they need to adjust their transmission behavior in accordance with the network...
Dorgham Sisalem, Adam Wolisz
XSYM
2007
Springer
150views Database» more  XSYM 2007»
14 years 4 months ago
Fast Answering of XPath Query Workloads on Web Collections
Several web applications (such as processing RSS feeds or web service messages) rely on XPath-based data manipulation tools. Web developers need to use XPath queries effectively o...
Mariano P. Consens, Flavio Rizzolo
IPPS
2006
IEEE
14 years 4 months ago
Making lockless synchronization fast: performance implications of memory reclamation
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
Thomas E. Hart, Paul E. McKenney, Angela Demke Bro...