Sciweavers

1623 search results - page 264 / 325
» No Sorting
Sort
View
MST
1998
75views more  MST 1998»
15 years 3 months ago
Periodic Merging Networks
We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcherâ...
Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oes...
PC
1998
202views Management» more  PC 1998»
15 years 3 months ago
BSPlib: The BSP programming library
BSPlib is a small communications library for bulk synchronous parallel (BSP) programming which consists of only 20 basic operations. This paper presents the full de nition of BSPl...
Jonathan M. D. Hill, Bill McColl, Dan C. Stefanesc...
PE
1998
Springer
104views Optimization» more  PE 1998»
15 years 3 months ago
Analysis of Transient of the Datagram Traffic for a Demand Assignment TDMA
- A modified version of the datagram capacity assignment of the FODA access scheme, named FODA/IBEA, is briefly presented. The main difference from the previous version (besides th...
Nedo Celandroni
116
Voted
PRL
2002
70views more  PRL 2002»
15 years 3 months ago
On the use of nearest feature line for speaker identification
As a new pattern classification method, nearest feature line (NFL) provides an effective way to tackle the sort of pattern recognition problems where only limited data are availab...
Ke Chen 0001, Ting-Yao Wu, HongJiang Zhang
118
Voted
TIS
1998
106views more  TIS 1998»
15 years 3 months ago
The Meaning of the Web
Speculation about the meaning of the "Net" (the Internet and potentially associated networks), and its most rapidly developing dimension, the "Web" (the World ...
Jim Falk