Sciweavers

1722 search results - page 131 / 345
» Generating Tests from Counterexamples
Sort
View
POPL
2007
ACM
16 years 27 days ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
123
Voted
IM
2007
15 years 11 days ago
Cluster Generation and Labeling for Web Snippets: A Fast, Accurate Hierarchical Solution
This paper describes Armil, a meta-search engine that groups the web snippets returned by auxiliary search engines into disjoint labeled clusters. The cluster labels generated by A...
Filippo Geraci, Marco Pellegrini, Marco Maggini, F...
ICTAI
2006
IEEE
15 years 6 months ago
Learning to Predict Salient Regions from Disjoint and Skewed Training Sets
We present an ensemble learning approach that achieves accurate predictions from arbitrarily partitioned data. The partitions come from the distributed processing requirements of ...
Larry Shoemaker, Robert E. Banfield, Lawrence O. H...
115
Voted
IDA
2010
Springer
15 years 4 months ago
Statistical Modelling for Data from Experiments with Short Hairpin RNAs
This paper delivers an example of applying intelligent data analysis to biological data where the success of the project was only possible due to joint efforts of the experts from ...
Frank Klawonn, Torsten Wüstefeld, Lars Zender
81
Voted
COLING
1996
15 years 1 months ago
The Automatic Extraction of Open Compounds from Text Corpora
This paper describes a new method for extracting open compounds (uninterrupted sequences of words) from text corpora of languages, such as Thai, Japanese and Korea that exhibit un...
Virach Sornlertlamvanich, Hozumi Tanaka