Sciweavers

576 search results - page 104 / 116
» Optimizing Information Agents by Selectively Materializing D...
Sort
View
ISNN
2011
Springer
12 years 11 months ago
Orthogonal Feature Learning for Time Series Clustering
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
Xiaozhe Wang, Leo Lopes
ICDM
2009
IEEE
149views Data Mining» more  ICDM 2009»
14 years 2 months ago
Accelerated Gradient Method for Multi-task Sparse Learning Problem
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
Xi Chen, Weike Pan, James T. Kwok, Jaime G. Carbon...
BMCBI
2005
98views more  BMCBI 2005»
13 years 8 months ago
Iterative approach to model identification of biological networks
Background: Recent advances in molecular biology techniques provide an opportunity for developing detailed mathematical models of biological processes. An iterative scheme is intr...
Kapil G. Gadkar, Rudiyanto Gunawan, Francis J. Doy...
CSFW
2009
IEEE
14 years 2 months ago
More Anonymous Onion Routing Through Trust
We consider using trust information to improve the anonymity provided by onion-routing networks. In particular, we introduce a model of trust in network nodes and use it to design...
Aaron Johnson, Paul F. Syverson
BMCBI
2005
94views more  BMCBI 2005»
13 years 8 months ago
A method for finding single-nucleotide polymorphisms with allele frequencies in sequences of deep coverage
Background: The allele frequencies of single-nucleotide polymorphisms (SNPs) are needed to select an optimal subset of common SNPs for use in association studies. Sequence-based m...
Jianmin Wang, Xiaoqiu Huang