Sciweavers

1422 search results - page 153 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
128
Voted
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
16 years 3 months ago
Regularized multi--task learning
Past empirical work has shown that learning multiple related tasks from data simultaneously can be advantageous in terms of predictive performance relative to learning these tasks...
Theodoros Evgeniou, Massimiliano Pontil
135
Voted
RECOMB
2007
Springer
16 years 3 months ago
An Efficient and Accurate Graph-Based Approach to Detect Population Substructure
Currently, large-scale projects are underway to perform whole genome disease association studies. Such studies involve the genotyping of hundreds of thousands of SNP markers. One o...
Srinath Sridhar, Satish Rao, Eran Halperin
124
Voted
EDBT
2008
ACM
120views Database» more  EDBT 2008»
16 years 3 months ago
Schema mapping verification: the spicy way
Schema mapping algorithms rely on value correspondences ? i.e., correspondences among semantically related attributes ? to produce complex transformations among data sources. Thes...
Angela Bonifati, Giansalvatore Mecca, Alessandro P...
IAT
2006
IEEE
15 years 9 months ago
Multi-Agent Coordination and Cooperation through Classical Planning
Multi-agent planning is a fundamental problem in multiagent systems that has acquired a variety of meanings in the relative literature. In this paper we focus on a setting where m...
Yannis Dimopoulos, Pavlos Moraitis
171
Voted
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 7 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein