Sciweavers

1040 search results - page 196 / 208
» Rounding algorithms for covering problems
Sort
View
ICPP
2009
IEEE
15 years 4 months ago
Run to Potential: Sweep Coverage in Wireless Sensor Networks
—Wireless sensor networks have become a promising technology in monitoring physical world. In many applications with wireless sensor networks, it is essential to understand how w...
Min Xi, Kui Wu, Yong Qi, Jizhong Zhao, Yunhao Liu,...
WOWMOM
2006
ACM
135views Multimedia» more  WOWMOM 2006»
15 years 3 months ago
MCMSDA: A Multi-Channel Multi-Sector Directional Antenna Wireless LAN
Recently there is an increasing interest in using directional antennas and multi-channel for Ad-hoc wireless networks. Directional antennas provide higher capacity and less multi-...
Yong Huang, Weibo Gong, Dev Gupta
CIKM
2008
Springer
14 years 11 months ago
On effective presentation of graph patterns: a structural representative approach
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
Chen Chen, Cindy Xide Lin, Xifeng Yan, Jiawei Han
JMLR
2006
169views more  JMLR 2006»
14 years 9 months ago
Bayesian Network Learning with Parameter Constraints
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...
Radu Stefan Niculescu, Tom M. Mitchell, R. Bharat ...
JUCS
2007
95views more  JUCS 2007»
14 years 9 months ago
Using Place Invariants and Test Point Placement to Isolate Faults in Discrete Event Systems
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...
Iwan Tabakow