Sciweavers

83 search results - page 2 / 17
» Solving Coverage Problems with Embedded Graph Grammars
Sort
View
IPCCC
2007
IEEE
13 years 11 months ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002
ICRA
2007
IEEE
138views Robotics» more  ICRA 2007»
13 years 11 months ago
Barrier Coverage for Variable Bounded-Range Line-of-Sight Guards
Abstract— In this paper, we formalize the problem of barrier coverage, that is, the problem of preventing undetected intrusion in a particular region using robot sensors. We solv...
Stephen Kloder, Seth Hutchinson
TCS
2011
13 years 4 days ago
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
Pinar Heggernes, Daniel Meister, Andrzej Proskurow...
ATAL
2010
Springer
13 years 6 months ago
A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings
ICASSP
2008
IEEE
13 years 11 months ago
Effective error prediction using decision tree for ASR grammar network in call system
CALL (Computer Assisted Language Learning) systems using ASR (Automatic Speech Recognition) for second language learning have received increasing interest recently. However, it st...
Hongcui Wang, Tatsuya Kawahara