3247 search results - page 127 / 650 » Randomized smoothing networks |
125
click to vote
ISCC
2003
IEEE
15 years 9 months ago
2003
IEEE
Abstract—The link layer of an optical direct-detection code-division multiple-access (CDMA) packet network is considered. Two different protocols that need pretransmission coordi...
130
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
180
Voted
ICDCN
2011
Springer
14 years 7 months ago
2011
Springer
This paper proposes to use video sensor nodes to provide an efficient intrusion detection system. We use a scheduling mechanism that takes into account the criticality of the surve...
117
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
152
click to vote
AAAI
2008
15 years 6 months ago
2008
In multi-robot settings, activity recognition allows a robot to respond intelligently to the other robots in its environment. Conditional random fields are temporal models that ar...