Sciweavers

155 search results - page 21 / 31
» Reducing Design Complexity of the Load Store Queue
Sort
View
MMB
2010
Springer
194views Communications» more  MMB 2010»
14 years 25 days ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
CODES
2007
IEEE
14 years 2 months ago
Ensuring secure program execution in multiprocessor embedded systems: a case study
Multiprocessor SoCs are increasingly deployed in embedded systems with little or no security features built in. Code Injection attacks are one of the most commonly encountered sec...
Krutartha Patel, Sridevan Parameswaran, Seng Lin S...
SIGMOD
2009
ACM
172views Database» more  SIGMOD 2009»
14 years 2 months ago
Self-organizing tuple reconstruction in column-stores
Column-stores gained popularity as a promising physical design alternative. Each attribute of a relation is physically stored as a separate column allowing queries to load only th...
Stratos Idreos, Martin L. Kersten, Stefan Manegold
MOBICOM
2006
ACM
14 years 2 months ago
Double rulings for information brokerage in sensor networks
We study the problem of information brokerage in sensor networks, where information consumers (sinks, users) search for data acquired by information producers (sources). Innetwork...
Rik Sarkar, Xianjin Zhu, Jie Gao
ITIIS
2010
129views more  ITIIS 2010»
13 years 2 months ago
Encryption Scheme for MPEG-4 Media Transmission Exploiting Frame Dropping
Depending on network conditions, a communication network could be overloaded when media are transmitted. Research has been carried out to lessen network overloading, such as by fi...
Dongkyoo Shin, Dongil Shin, Jaewan Shin, Soohan Ki...