2621 search results - page 153 / 525 » Near orders and codes |
179
click to vote
IPL
2010
15 years 5 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
204
click to vote
TMM
2011
15 years 1 months ago
2011
Abstract—Supporting video transmission over error-prone mobile ad-hoc networks is becoming increasingly important as these networks become more widely deployed. We propose a rout...
226
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
248
click to vote
SOSP
2003
ACM
16 years 3 months ago
2003
ACM
This paper presents a new approach called model-carrying code (MCC) for safe execution of untrusted code. At the heart of MCC is the idea that untrusted code comes equipped with a...
175
click to vote
CASES
2006
ACM
16 years 14 days ago
2006
ACM
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...