Sciweavers

1435 search results - page 281 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
SIGSOFT
2006
ACM
14 years 8 months ago
Dynamic slicing long running programs through execution fast forwarding
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
Xiangyu Zhang, Sriraman Tallam, Rajiv Gupta
PPOPP
2009
ACM
14 years 8 months ago
Formal verification of practical MPI programs
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
Anh Vo, Sarvani S. Vakkalanka, Michael Delisi, Gan...
ICMI
2003
Springer
128views Biometrics» more  ICMI 2003»
14 years 17 days ago
Modeling multimodal integration patterns and performance in seniors: toward adaptive processing of individual differences
Multimodal interfaces are designed with a focus on flexibility, although very few currently are capable of adapting to major sources of user, task, or environmental variation. The...
Benfang Xiao, Rebecca Lunsford, Rachel Coulston, R...
VLDB
1998
ACM
127views Database» more  VLDB 1998»
13 years 11 months ago
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...
CIKM
2008
Springer
13 years 9 months ago
Modeling LSH for performance tuning
Although Locality-Sensitive Hashing (LSH) is a promising approach to similarity search in high-dimensional spaces, it has not been considered practical partly because its search q...
Wei Dong, Zhe Wang, William Josephson, Moses Chari...