Sciweavers

164 search results - page 19 / 33
» Maximally joining probabilistic data
Sort
View
BMCBI
2007
182views more  BMCBI 2007»
14 years 9 months ago
EDISA: extracting biclusters from multiple time-series of gene expression profiles
Background: Cells dynamically adapt their gene expression patterns in response to various stimuli. This response is orchestrated into a number of gene expression modules consistin...
Jochen Supper, Martin Strauch, Dierk Wanke, Klaus ...
JMLR
2010
144views more  JMLR 2010»
14 years 4 months ago
Practical Approaches to Principal Component Analysis in the Presence of Missing Values
Principal component analysis (PCA) is a classical data analysis technique that finds linear transformations of data that retain the maximal amount of variance. We study a case whe...
Alexander Ilin, Tapani Raiko
MOBICOM
2003
ACM
15 years 2 months ago
ARC: an integrated admission and rate control framework for CDMA data networks based on non-cooperative games
The competition among wireless data service providers brings in an option for the customers to switch their providers, due to unsatisfactory service or otherwise. However, the exi...
Haitao Lin, Mainak Chatterjee, Sajal K. Das, Kalya...
CLEF
2009
Springer
14 years 10 months ago
Unsupervised Word Decomposition with the Promodes Algorithm
We present Promodes, an algorithm for unsupervised word decomposition, which is based on a probabilistic generative model. The model considers segment boundaries as hidden variable...
Sebastian Spiegler, Bruno Golénia, Peter A....
ICDE
2008
IEEE
100views Database» more  ICDE 2008»
15 years 11 months ago
Mobile Filter: Exploring Migration of Filters for Error-Bounded Data Collection in Sensor Networks
In wireless sensor networks, filters, which suppress data update reports within predefined error bounds, effectively reduce the traffic volume for continuous data collection. All p...
Dan Wang, Jianliang Xu, Jiangchuan Liu, Feng Wang