Sciweavers

4670 search results - page 27 / 934
» Testing that distributions are close
Sort
View
ICML
2007
IEEE
14 years 10 months ago
Discriminative learning for differing training and test distributions
We address classification problems for which the training instances are governed by a distribution that is allowed to differ arbitrarily from the test distribution--problems also ...
Michael Brückner, Steffen Bickel, Tobias Sche...
ICML
2006
IEEE
14 years 10 months ago
Combined central and subspace clustering for computer vision applications
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...
Le Lu, René Vidal
TPDS
1998
98views more  TPDS 1998»
13 years 9 months ago
A Basic-Cycle Calculation Technique for Efficient Dynamic Data Redistribution
—Array redistribution is usually required to enhance algorithm performance in many parallel programs on distributed memory multicomputers. Since it is performed at run-time, ther...
Yeh-Ching Chung, Ching-Hsien Hsu, Sheng-Wen Bai
SIGMOD
2012
ACM
234views Database» more  SIGMOD 2012»
12 years 3 days ago
BloomUnit: declarative testing for distributed programs
We present BloomUnit, a testing framework for distributed programs written in the Bloom language. BloomUnit allows developers to write declarative test specifications that descri...
Peter Alvaro, Andrew Hutchinson, Neil Conway, Will...
JSS
2008
122views more  JSS 2008»
13 years 8 months ago
Traffic-aware stress testing of distributed real-time systems based on UML models using genetic algorithms
This report presents a model-driven, stress test methodology aimed at increasing chances of discovering faults related to network traffic in Distributed Real-Time Systems (DRTS). T...
Vahid Garousi, Lionel C. Briand, Yvan Labiche