Sciweavers

11740 search results - page 231 / 2348
» More Problems in Rewriting
Sort
View
ICASSP
2011
IEEE
14 years 10 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...
CVPR
2004
IEEE
16 years 8 months ago
Point Matching as a Classification Problem for Fast and Robust Object Pose Estimation
We propose a novel approach to point matching under large viewpoint and illumination changes that is suitable for accurate object pose estimation at a much lower computational cos...
Vincent Lepetit, Julien Pilet, Pascal Fua
MOBICOM
2009
ACM
16 years 1 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...
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
16 years 12 hour ago
The Conference Call Search Problem in Wireless Networks
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...
Leah Epstein, Asaf Levin
CVPR
1997
IEEE
15 years 10 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