Sciweavers

14898 search results - page 2863 / 2980
» Design of Neural Networks
Sort
View
ANCS
2009
ACM
15 years 2 months ago
Range Tries for scalable address lookup
In this paper we introduce the Range Trie, a new multiway tree data structure for address lookup. Each Range Trie node maps to an address range [Na, Nb) and performs multiple comp...
Ioannis Sourdis, Georgios Stefanakis, Ruben de Sme...
ANCS
2009
ACM
15 years 2 months ago
Progressive hashing for packet processing using set associative memory
As the Internet grows, both the number of rules in packet filtering databases and the number of prefixes in IP lookup tables inside the router are growing. The packet processing e...
Michel Hanna, Socrates Demetriades, Sangyeun Cho, ...
TWC
2011
245views more  TWC 2011»
14 years 12 months ago
Cooperative Filter-and-Forward Beamforming for Frequency-Selective Channels with Equalization
Most of the existing literature on cooperative relay networks has focused on frequency– nonselective channels or frequency–selective channels with multi–carrier transmission...
Yang-wen Liang, Aïssa Ikhlef, Wolfgang H. Ger...
WWW
2011
ACM
14 years 12 months ago
Towards semantic knowledge propagation from text corpus to web images
In this paper, we study the problem of transfer learning from text to images in the context of network data in which link based bridges are available to transfer the knowledge bet...
Guojun Qi, Charu C. Aggarwal, Thomas Huang
WWW
2011
ACM
14 years 12 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
« Prev « First page 2863 / 2980 Last » Next »