Sciweavers

9 search results - page 2 / 2
» Target Counting under Minimal Sensing: Complexity and Approx...
Sort
View
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
13 years 6 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen
TSP
2012
12 years 14 days ago
Sensing and Probing Cardinalities for Active Cognitive Radios
—In a cognitive radio network, opportunistic spectrum access (OSA) to the underutilized spectrum involves not only sensing the spectrum occupancy but also probing the channel qua...
Thang Van Nguyen, Hyundong Shin, Tony Q. S. Quek, ...
GI
2009
Springer
13 years 2 months ago
Combined Optimization of Aircraft Maneuvers and RF Measurements for Passive Air-Air Ranging
: When a tactical aircraft sets out on a mission in dense airborne and surface RF (radio frequency) emitter environment, the pilot desires to minimize the use of the onboard fire c...
Ronald Matthew Yannone, Melvin Carroll
ALT
1997
Springer
13 years 9 months ago
Learning DFA from Simple Examples
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
Rajesh Parekh, Vasant Honavar