Sciweavers

860 search results - page 140 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
ICDT
2010
ACM
205views Database» more  ICDT 2010»
14 years 16 days ago
On the Aggregation Problem for Synthesized Web Services
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
Ting Deng, Wenfei Fan, Leonid Libkin, Yinghui Wu
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 7 months ago
Online Scheduling to Minimize the Maximum Delay Factor
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcast...
Chandra Chekuri, Benjamin Moseley
IPM
2008
196views more  IPM 2008»
13 years 7 months ago
Author identification: Using text sampling to handle the class imbalance problem
Authorship analysis of electronic texts assists digital forensics and anti-terror investigation. Author identification can be seen as a single-label multi-class text categorizatio...
Efstathios Stamatatos
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
14 years 8 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
BMCBI
2010
87views more  BMCBI 2010»
13 years 7 months ago
poolMC: Smart pooling of mRNA samples in microarray experiments
Background: Typically, pooling of mRNA samples in microarray experiments implies mixing mRNA from several biological-replicate samples before hybridization onto a microarray chip....
Raghunandan M. Kainkaryam, Angela Bruex, Anna C. G...