Sciweavers

19 search results - page 4 / 4
» Deciding Local Theory Extensions via E-matching
Sort
View
JSAC
2008
140views more  JSAC 2008»
13 years 4 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
FGR
2008
IEEE
221views Biometrics» more  FGR 2008»
13 years 11 months ago
Markovian mixture face recognition with discriminative face alignment
A typical automatic face recognition system is composed of three parts: face detection, face alignment and face recognition. Conventionally, these three parts are processed in a b...
Ming Zhao 0003, Tat-Seng Chua
SENSYS
2003
ACM
13 years 10 months ago
Model-based compression in wireless ad hoc networks
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
MOBIHOC
2010
ACM
13 years 2 months ago
Barrier coverage with sensors of limited mobility
Barrier coverage is a critical issue in wireless sensor networks for various battlefield and homeland security applications. The goal is to effectively detect intruders that attem...
Anwar Saipulla, Benyuan Liu, Guoliang Xing, Xinwen...