4887 search results - page 959 / 978 » System Level Design Using C |
134
click to vote
MMB
2010
Springer
15 years 6 months ago
2010
Springer
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...
145
click to vote
COCOON
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
121
click to vote
SIGMOD
1997
ACM
15 years 6 months ago
1997
ACM
The goal of the InfoSleuth project at MCC is to exploit and synthesize new technologies into a uni ed system that retrieves and processes information in an ever-changing network o...
112
click to vote
CASES
2009
ACM
15 years 5 months ago
2009
ACM
In this paper we introduce Resizable Data Composer-Cache (RDC-Cache). This novel cache architecture operates correctly at sub 500 mV in 65 nm technology tolerating large number of...
117
click to vote
USS
2008
15 years 4 months ago
2008
Optical scan electronic voting machines employ software components that are customized for each specific election. Such software components are critical from a security and integr...