default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 34 matches
- 2003
- Federico Angiolini, Luca Benini, Alberto Caprara:
Polynomial-time algorithm for on-chip scratchpad memory partitioning. CASES 2003: 318-326 - Massimo Baleani, Alberto Ferrari, Leonardo Mangeruca, Alberto L. Sangiovanni-Vincentelli, Maurizio Peri, Saverio Pezzini:
Fault-tolerant platforms for automotive safety-critical applications. CASES 2003: 170-177 - Partha Biswas, Nikil D. Dutt:
Reducing code size for heterogeneous-connectivity-based VLIW DSPs through synthesis of instruction set extensions. CASES 2003: 104-112 - Guilin Chen, Mahmut T. Kandemir, Hendra Saputra, Mary Jane Irwin:
Exploiting bank locality in multi-bank memories. CASES 2003: 287-297 - Osvaldo Colavin, Davide Rizzo:
A scalable wide-issue clustered VLIW with a reconfigurable interconnect. CASES 2003: 148-158 - Alain Darte, Robert Schreiber, Gilles Villard:
Lattice-based memory allocation. CASES 2003: 298-308 - Andreas Ermedahl, Friedhelm Stappert, Jakob Engblom:
Clustered calculation of worst-case execution times. CASES 2003: 51-62 - Joseph A. Fisher:
Moving from embedded systems to embedded computing. CASES 2003: 1 - David Goodwin, Darin Petkov:
Automatic generation of application specific processors. CASES 2003: 137-147 - Ann Gordon-Ross, Frank Vahid:
Frequent loop detection using efficient non-intrusive on-chip hardware. CASES 2003: 117-124 - Hillery C. Hunter, Jaime H. Moreno:
A new look at exploiting data parallelism in embedded systems. CASES 2003: 159-169 - Rajeev Krishna, Scott A. Mahlke, Todd M. Austin:
Architectural optimizations for low-power, real-time speech recognition. CASES 2003: 220-231 - Chidamber Kulkarni, Matthias Gries, Christian Sauer, Kurt Keutzer:
Programming challenges in network processor deployment. CASES 2003: 178-187 - Jeremy Lau, Stefan Schoenmackers, Timothy Sherwood, Brad Calder:
Reducing code size with echo instructions. CASES 2003: 84-94 - Bengu Li, Rajiv Gupta:
Simple offset assignment in presence of subword data. CASES 2003: 12-23 - Binu K. Mathew, Al Davis, Zhen Fang:
A low-power accelerator for the SPHINX 3 speech recognition system. CASES 2003: 210-219 - Sumit Mohanty, Viktor K. Prasanna:
A hierarchical approach for energy efficient application design using heterogeneous embedded systems. CASES 2003: 243-254 - Dorit Naishlos, Marina Biberstein, Shay Ben-David, Ayal Zaks:
Vectorizing for a SIMdD DSP architecture. CASES 2003: 2-11 - V. Krishna Nandivada, Jens Palsberg:
Efficient spill code for SDRAM. CASES 2003: 24-31 - Juanjo Noguera, Rosa M. Badia:
System-level power-performance trade-offs in task scheduling for dynamically reconfigurable architectures. CASES 2003: 73-83 - Dino Oliva, Rainer Buchty, Nevin Heintze:
AES and the cryptonite crypto processor. CASES 2003: 198-209 - Krishna V. Palem:
Energy aware algorithm design via probabilistic computing: from algorithms and models to Moore's law and novel (semiconductor) devices. CASES 2003: 113-116 - Peter Poplavko, Twan Basten, Marco Bekooij, Jef L. van Meerbergen, Bart Mesman:
Task-level timing models for guaranteed performance in multiprocessor networks-on-chip. CASES 2003: 63-72 - Rajiv A. Ravindran, Robert M. Senger, Eric D. Marsman, Ganesh S. Dasika, Matthew R. Guthaus, Scott A. Mahlke, Richard B. Brown:
Increasing the number of effective registers in a low-power processor using a windowed register file. CASES 2003: 125-136 - Montserrat Ros, Peter Sutton:
Compiler optimization and ordering effects on VLIW code compression. CASES 2003: 95-103 - Dinesh C. Suresh, Banit Agrawal, Jun Yang, Walid A. Najjar, Laxmi N. Bhuyan:
Power efficient encoding techniques for off-chip data buses. CASES 2003: 267-275 - Andrei Sergeevich Terechko, Erwan Le Thenaff, Henk Corporaal:
Cluster assignment of global values for clustered VLIW processors. CASES 2003: 32-40 - Sumesh Udayakumaran, Rajeev Barua:
Compiler-decided dynamic memory allocation for scratch-pad based embedded systems. CASES 2003: 276-286 - Ankush Varma, Brinda Ganesh, Mainak Sen, Suchismita Roy Choudhury, Lakshmi Srinivasan, Bruce L. Jacob:
A control-theoretic approach to dynamic voltage scheduling. CASES 2003: 255-266 - Ramnath Venugopalan, Prasanth Ganesan, Pushkin Peddabachagari, Alexander G. Dean, Frank Mueller, Mihail L. Sichitiu:
Encryption overhead in embedded systems and sensor network nodes: modeling and analysis. CASES 2003: 188-197
skipping 4 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-22 11:01 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint