Sciweavers

14518 search results - page 263 / 2904
» Two Problems for Sophistication
Sort
View
INFORMATICALT
2002
150views more  INFORMATICALT 2002»
15 years 25 days ago
Search for Dynamic Equilibrium in Duel Problems by Global Optimization
Two examples of open-loop differential games are considered in the paper. Starting with simplified dynamic Duel, further it was developed to differential economic Duel modelling pr...
Raimundas Matulevicius
ICASSP
2011
IEEE
14 years 4 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...
MOBICOM
2009
ACM
15 years 7 months ago
Neighbor discovery in wireless networks and the coupon collector's problem
—Neighbor discovery1 is one of the first steps in the initialization of a wireless ad hoc network. In this paper, we design and analyze practical algorithms for neighbor discove...
Sudarshan Vasudevan, Donald F. Towsley, Dennis Goe...
CVPR
1997
IEEE
15 years 5 months ago
Learning bilinear models for two-factor problems in vision
In many vision problems, we want to infer two (or more) hidden factors which interact to produce our observations. We may want to disentangle illuminant and object colors in color...
William T. Freeman, Joshua B. Tenenbaum
INFOCOM
2007
IEEE
15 years 7 months ago
Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor Networks
Abstract— We consider a scenario where a sophisticated jammer jams an area in a single-channel wireless sensor network. The jammer controls the probability of jamming and transmi...
Mingyan Li, Iordanis Koutsopoulos, Radha Poovendra...