The following pages link to Yingshu Li (Q192303):
Displaying 32 items.
- \((\alpha,\tau )\)-monitoring for event detection in wireless sensor networks (Q346476) (← links)
- Approximate event detection over multi-modal sensing data (Q346477) (← links)
- On the construction of \(k\)-connected \(m\)-dominating sets in wireless networks (Q434202) (← links)
- Neighborhood-based uncertainty generation in social networks (Q489696) (← links)
- Computing an effective decision making group of a society using social network analysis (Q489699) (← links)
- A greedy approximation for minimum connected dominating sets (Q706637) (← links)
- A note on optical network with nonsplitting nodes (Q813337) (← links)
- Minimum connected dominating sets and maximal independent sets in unit disk graphs (Q818109) (← links)
- Optimization scheme for sensor coverage scheduling with bandwidth constraints (Q1001327) (← links)
- Design and analysis of a self-tuning feedback controller for the internet (Q1030981) (← links)
- SEF view deletion under bounded condition (Q1630986) (← links)
- Repair position selection for inconsistent data (Q1699811) (← links)
- A framework of distributed indexing and data dissemination in large scale wireless sensor networks (Q1958632) (← links)
- How hard is completeness reasoning for conjunctive queries? (Q2019449) (← links)
- On the complexity and approximability of repair position selection problem (Q2051902) (← links)
- Triangle edge deletion on planar glasses-free RGB-digraphs (Q2317352) (← links)
- Vertex cover in conflict graphs (Q2424881) (← links)
- Designing \(k\)-coverage schedules in wireless sensor networks (Q2427436) (← links)
- Continuous data aggregation and capacity in probabilistic wireless sensor networks (Q2443003) (← links)
- On error-tolerant DNA screening (Q2499595) (← links)
- Parameterized complexity of completeness reasoning for conjunctive queries (Q2661762) (← links)
- Influence analysis: A survey of the state-of-the-art (Q2668539) (← links)
- (Q2742044) (← links)
- On the Complexity of Bounded Deletion Propagation (Q2958337) (← links)
- DISTRIBUTED ENERGY-EFFICIENT ALGORITHMS FOR COVERAGE PROBLEM IN ADJUSTABLE SENSING RANGES WIRELESS SENSOR NETWORKS (Q3646202) (← links)
- Generating Uncertain Networks Based on Historical Network Snapshots (Q4925292) (← links)
- A Dominating Set Based Approach to Identify Effective Leader Group of Social Network (Q4925306) (← links)
- EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS (Q5189986) (← links)
- Efficient respondents selection for biased survey using homophily-high social relation graph (Q5298357) (← links)
- (Q5692514) (← links)
- Efficient aggregation algorithms on very large compressed data warehouses (Q5938681) (← links)
- Minimum-latency aggregation scheduling in wireless sensor network (Q5963622) (← links)
