Sciweavers

612 search results - page 15 / 123
» Using Data Compressors to Construct Rank Tests
Sort
View
DAGSTUHL
2003
14 years 11 months ago
Ranked representation of vector fields
Abstract Browsing and visualizing large datasets is often a tedious chore. Locating features, especially in a wavelet transform domain is usually offered as a possible solution. W...
Bala Krishna Nakshatrala, David Thompson, Raghu Ma...
ICML
2006
IEEE
15 years 11 months ago
Constructing informative priors using transfer learning
Many applications of supervised learning require good generalization from limited labeled data. In the Bayesian setting, we can try to achieve this goal by using an informative pr...
Rajat Raina, Andrew Y. Ng, Daphne Koller
ICSE
2003
IEEE-ACM
15 years 3 months ago
Data Flow Testing as Model Checking
This paper presents a model checking-based approach to data flow testing. We characterize data flow oriented coverage criteria in temporal logic such that the problem of test ge...
Hyoung Seok Hong, Sung Deok Cha, Insup Lee, Oleg S...
ERLANG
2008
ACM
14 years 12 months ago
Testing Erlang data types with quviq quickcheck
When creating software, data types are the basic bricks. Most of the time a programmer will use data types defined in library modules, therefore being tested by many users over ma...
Thomas Arts, Laura M. Castro, John Hughes
ICCV
2011
IEEE
13 years 10 months ago
Latent Low-Rank Representation for Subspace Segmentation and Feature Extraction
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
Guangcan Liu, Shuicheng Yan