Sciweavers

716 search results - page 39 / 144
» Algorithmic Issues in Coding Theory
Sort
View
CASES
2006
ACM
15 years 8 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
ISSAC
2007
Springer
112views Mathematics» more  ISSAC 2007»
15 years 8 months ago
G-graphs for the cage problem: a new upper bound
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
Alain Bretto, Luc Gillibert
MOBIHOC
2010
ACM
15 years 10 days ago
Data preservation under spatial failures in sensor networks
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial s...
Navid Hamed Azimi, Himanshu Gupta, Xiaoxiao Hou, J...
ICCAD
2008
IEEE
108views Hardware» more  ICCAD 2008»
15 years 11 months ago
FBT: filled buffer technique to reduce code size for VLIW processors
— VLIW processors provide higher performance and better efficiency etc. than RISC processors in specific domains like multimedia applications etc. A disadvantage is the bloated...
Talal Bonny, Jörg Henkel
CVPR
2011
IEEE
14 years 10 months ago
Online Detection of Unusual Events in Videos via Dynamic Sparse Coding
Real-time unusual event detection in video stream has been a difficult challenge due to the lack of sufficient training information, volatility of the definitions for both norm...
Bin Zhao, Li Fei-Fei, Eric Xing