Sciweavers

2531 search results - page 68 / 507
» Group testing in graphs
Sort
View
BMCBI
2007
147views more  BMCBI 2007»
13 years 11 months ago
Statistical analysis and significance testing of serial analysis of gene expression data using a Poisson mixture model
Background: Serial analysis of gene expression (SAGE) is used to obtain quantitative snapshots of the transcriptome. These profiles are count-based and are assumed to follow a Bin...
Scott D. Zuyderduyn
ICPR
2004
IEEE
14 years 12 months ago
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
Fred W. DePiero
JAIR
2008
123views more  JAIR 2008»
13 years 10 months ago
The Computational Complexity of Dominance and Consistency in CP-Nets
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
Judy Goldsmith, Jérôme Lang, Miroslaw...
ICML
2010
IEEE
13 years 12 months ago
Online Learning for Group Lasso
We develop a novel online learning algorithm for the group lasso in order to efficiently find the important explanatory factors in a grouped manner. Different from traditional bat...
Haiqin Yang, Zenglin Xu, Irwin King, Michael R. Ly...
PAKDD
2007
ACM
184views Data Mining» more  PAKDD 2007»
14 years 4 months ago
Exploring Group Moving Pattern for an Energy-Constrained Object Tracking Sensor Network
In this paper, we investigate and utilize the characteristic of the group movement of objects to achieve energy conservation in the inherently resource-constrained wireless object ...
Hsiao-Ping Tsai, De-Nian Yang, Wen-Chih Peng, Ming...