Sciweavers

2192 search results - page 252 / 439
» Algorithms for Challenging Motif Problems
Sort
View
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
15 years 10 months ago
Finding Predictive Runs with LAPS
We present an extension to the Lasso [9] for binary classification problems with ordered attributes. Inspired by the Fused Lasso [8] and the Group Lasso [10, 4] models, we aim to...
Suhrid Balakrishnan, David Madigan
HPCS
2005
IEEE
15 years 9 months ago
A Lightweight, Scalable Grid Computing Framework for Parallel Bioinformatics Applications
Abstract— In recent years our society has witnessed an unprecedented growth in computing power available to tackle important problems in science, engineering and medicine. For ex...
Hans De Sterck, Rob S. Markel, Rob Knight
COMCOM
2006
121views more  COMCOM 2006»
15 years 3 months ago
Load-balanced agent activation for value-added network services
In relation to its growth in size and user population, the Internet faces new challenges that have triggered the proposals of value-added network services, e.g., IP multicast, IP ...
Chao Gong, Kamil Saraç, Ovidiu Daescu, Bala...
CVPR
2009
IEEE
16 years 11 months ago
Learning a Distance Metric from Multi-instance Multi-label Data
Multi-instance multi-label learning (MIML) refers to the learning problems where each example is represented by a bag/collection of instances and is labeled by multiple labels. ...
Rong Jin (Michigan State University), Shijun Wang...
SDM
2009
SIAM
251views Data Mining» more  SDM 2009»
16 years 1 months ago
High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic.
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
Alok N. Choudhary, Arifa Nisar, Waseem Ahmad, Wei-...