Sciweavers

735 search results - page 92 / 147
» Randomization in Parallel Stringology
Sort
View
GCC
2003
Springer
15 years 7 months ago
Dominating-Set-Based Searching in Peer-to-Peer Networks
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
Chunlin Yang, Jie Wu
SIGGRAPH
1994
ACM
15 years 6 months ago
FBRAM: a new form of memory optimized for 3D graphics
FBRAM, a new form of dynamic random access memory that greatly accelerates the rendering of Z-buffered primitives, is presented. Two key concepts make this acceleration possible. ...
Michael F. Deering, Stephen A. Schlapp, Michael G....
DMIN
2006
134views Data Mining» more  DMIN 2006»
15 years 3 months ago
Hyper-Rectangular and k-Nearest-Neighbor Models in Stochastic Discrimination
The stochastic discrimination (SD) theory considers learning as building models of uniform coverage over data distributions. Despite successful trials of the derived SD method in s...
Iryna Skrypnyk, Tin Kam Ho
JSAC
2006
95views more  JSAC 2006»
15 years 2 months ago
A low-rate code-spread and chip-interleaved time-hopping UWB system
We consider a code-spread and chip-interleaved time-hopping (TH) multiple-access scheme for multiuser ultra-wideband (UWB) communications. In such a system, each user's chip s...
Kai Li, Xiaodong Wang, Guosen Yue, Li Ping
PPL
2008
75views more  PPL 2008»
15 years 2 months ago
Modeling the Performance of Communication Schemes on Network Topologies
This paper investigates the influence of the interconnection network topology of a parallel system on the delivery time of an ensemble of messages, called the communication scheme...
Jan Lemeire, Erik F. Dirkx, Walter Colitti