Sciweavers

724 search results - page 39 / 145
» Discrete Rate Simulation using linear programming
Sort
View
ICC
2007
IEEE
138views Communications» more  ICC 2007»
14 years 3 months ago
Optimal Observation Scheduling for connected target coverage problem in Wireless Sensor Networks
— In this paper, we consider the problem of scheduling sensor activity to maximize network lifetime while maintaining both discrete targets coverage and network connectivity. We ...
Qun Zhao, Mohan Gurusamy
WIMOB
2008
IEEE
14 years 3 months ago
Rate Allocation with Lifetime Maximization and Fairness for Data Aggregation in Sensor Networks
—We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: 1) maximizing the lifetime of a local aggregation cluster and, 2) a...
Shouwen Lai, Binoy Ravindran, Hyeonjoong Cho
RECOMB
2006
Springer
14 years 9 months ago
Predicting Experimental Quantities in Protein Folding Kinetics Using Stochastic Roadmap Simulation
Abstract. This paper presents a new method for studying protein folding kinetics. It uses the recently introduced Stochastic Roadmap Simulation (SRS) method to estimate the transit...
Tsung-Han Chiang, Mehmet Serkan Apaydin, Douglas L...
DCC
2005
IEEE
14 years 8 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
14 years 9 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel