1245 search results - page 242 / 249 » Binary Sparse Coding |
118
click to vote
STOC
2006
ACM
15 years 12 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
110
click to vote
MICRO
2009
IEEE
15 years 6 months ago
2009
IEEE
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
COCOON
2009
Springer
15 years 6 months ago
2009
Springer
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
117
click to vote
KSEM
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
113
click to vote
MOBICOM
2009
ACM
15 years 6 months ago
2009
ACM
Intended for network-wide dissemination of commands, configurations and code binaries, flooding has been investigated extensively in wireless networks. However, little work has ...