Sciweavers

4887 search results - page 959 / 978
» System Level Design Using C
Sort
View
155
Voted
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 8 months 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
162
Voted
COCOON
1998
Springer
15 years 7 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
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...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
139
Voted
SIGMOD
1997
ACM
166views Database» more  SIGMOD 1997»
15 years 7 months ago
The InfoSleuth Project
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...
Roberto J. Bayardo Jr., William Bohrer, Richard S....
125
Voted
CASES
2009
ACM
15 years 7 months ago
A fault tolerant cache architecture for sub 500mV operation: resizable data composer cache (RDC-cache)
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...
Avesta Sasan, Houman Homayoun, Ahmed M. Eltawil, F...
134
Voted
USS
2008
15 years 6 months ago
Pre-Election Testing and Post-Election Audit of Optical Scan Voting Terminal Memory Cards
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...
Seda Davtyan, Sotiris Kentros, Aggelos Kiayias, La...