3247 search results - page 330 / 650 » Randomized smoothing networks |
194
click to vote
ICCD
2008
IEEE
16 years 3 months ago
2008
IEEE
— The increasing viability of three dimensional (3D) silicon integration technology has opened new opportunities for chip architecture innovations. One direction is in the extens...
165
Voted
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
The majority of existing wireless rate controls are based on the implicit assumption that frames are corrupted due to the random, arbitrary environmental and thermal noises. They ...
180
click to vote
ASUNAM
2010
IEEE
15 years 8 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
177
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This paper considers the problem of selecting either routes that consist of long hops or routes that consist of short hops in a network of multiple-antenna nodes, where each trans...
176
click to vote
GLOBECOM
2006
IEEE
16 years 23 days ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...