Sciweavers

94 search results - page 17 / 19
» Testing Whether a Set of Code Words Satisfies a Given Set of...
Sort
View
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 2 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
SIGSOFT
2009
ACM
14 years 8 months ago
Automatic steering of behavioral model inference
Many testing and analysis techniques use finite state models to validate and verify the quality of software systems. Since the specification of such models is complex and timecons...
David Lo, Leonardo Mariani, Mauro Pezzè
PAMI
2008
190views more  PAMI 2008»
13 years 8 months ago
Scene Classification Using a Hybrid Generative/Discriminative Approach
We investigate whether dimensionality reduction using a latent generative model is beneficial for the task of weakly supervised scene classification. In detail we are given a set ...
Anna Bosch, Andrew Zisserman, Xavier Muñoz
DAS
2010
Springer
14 years 26 days ago
Analysis of whole-book recognition
Whole-book recognition is a document image analysis strategy that operates on the complete set of a book’s page images, attempting to improve accuracy by automatic unsupervised ...
Pingping Xiu, Henry S. Baird
WAOA
2005
Springer
92views Algorithms» more  WAOA 2005»
14 years 1 months ago
The Conference Call Search Problem in Wireless Networks
Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user repo...
Leah Epstein, Asaf Levin