Sciweavers

963 search results - page 151 / 193
» On Computation of Performance Bounds of Optimal Index Assign...
Sort
View
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 3 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
15 years 10 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
TPDS
2008
136views more  TPDS 2008»
14 years 9 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
ICDCS
2008
IEEE
15 years 4 months ago
Mobility-Assisted Spatiotemporal Detection in Wireless Sensor Networks
Wireless sensor networks (WSNs) deployed for missioncritical applications face the fundamental challenge of meeting stringent spatiotemporal performance requirements using nodes w...
Guoliang Xing, Jianping Wang, Ke Shen, Qingfeng Hu...
INFOCOM
2010
IEEE
14 years 8 months ago
Opportunistic Routing in Multi-radio Multi-channel Multi-hop Wireless Networks
— Two major factors that limit the throughput in multi-hop wireless networks are the unreliability of wireless transmissions and co-channel interference. One promising technique ...
Kai Zeng, Zhenyu Yang, Wenjing Lou