18374 search results - page 339 / 3675 » Applications for data hiding |
195
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques ha...
190
click to vote
ISTA
2004
15 years 8 months ago
2004
: The article proposes a conceptual modeling technique based on Semantically Complete model, the main property of which is that relations carry complete information about interconn...
193
Voted
NIPS
2003
15 years 8 months ago
2003
In this paper, sparse representation (factorization) of a data matrix is first discussed. An overcomplete basis matrix is estimated by using the K−means method. We have proved ...
163
click to vote
WSC
1997
15 years 8 months ago
1997
The foundation of readiness is training. The Chairman, Joint Chiefs of Staff (CJCS) Joint Training Program institutes methods for identifying training requirements through review ...
166
click to vote
IJCGA
2007
15 years 6 months ago
2007
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) space and allows to answer the fo...