5 search results - page 1 / 1 » An efficient solution to the storage correspondence problem ... |
ASPDAC
2001
ACM
13 years 10 months ago
2001
ACM
Abstract- Traditional state-traversal-basedmethods for verifying sequential circuits are computationally infeasible for circuits with a large number of memory elements. However, if...
PVLDB
2008
13 years 6 months ago
2008
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
EMSOFT
2009
Springer
13 years 11 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
WICON
2010
13 years 4 months ago
2010
In order to meet the overwhelming demands of content retrieval for mobile end users, a novel architecture for the next-generation Internet called Cache-and-Forward (CNF) has been p...