87 search results - page 12 / 18 » Using hashing to solve the dictionary problem |
CVPR
2011
IEEE
13 years 3 months ago
2011
IEEE
We consider the problem of fitting one or more subspaces to a collection of data points drawn from the subspaces and corrupted by noise/outliers. We pose this problem as a rank m...
FROCOS
2007
Springer
14 years 1 months ago
2007
Springer
Web services send and receive messages in XML syntax with some parts hashed, encrypted or signed, according to the WS-Security standard. In this paper we introduce a model to forma...
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
— With the growth of Internet users and services, the IP address has been exhausted. In order to solve this problem, the short term solution was presented, i.e., CIDR (Classless ...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
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...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The Trinity [1] spam classification system is based on a distributed hash table that is implemented using a structured peer-to-peer overlay. Such an overlay must be capable of proc...