Sciweavers

6039 search results - page 1014 / 1208
» The Function Space of an Activity
Sort
View
STACS
1997
Springer
14 years 13 days ago
Predecessor Queries in Dynamic Integer Sets
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
Gerth Stølting Brodal
ICCAD
1994
IEEE
76views Hardware» more  ICCAD 1994»
14 years 13 days ago
An efficient procedure for the synthesis of fast self-testable controller structures
The BIST implementation of a conventionally synthesized controller in most cases requires the integration of an additional register only for test purposes. This leads to some seri...
Sybille Hellebrand, Hans-Joachim Wunderlich
PLDI
1993
ACM
14 years 12 days ago
Global Optimizations for Parallelism and Locality on Scalable Parallel Machines
Data locality is critical to achievinghigh performance on large-scale parallel machines. Non-local data accesses result in communication that can greatly impact performance. Thus ...
Jennifer-Ann M. Anderson, Monica S. Lam
VLDB
1993
ACM
116views Database» more  VLDB 1993»
14 years 11 days ago
Algebraic Optimization of Computations over Scientific Databases
Although scientific data analysis increasingly requires accessandmanipulation of large quantitiesof data,current databasetechnology fails to meet the needsof scientific processing...
Richard H. Wolniewicz, Goetz Graefe
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
14 years 10 days ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate
« Prev « First page 1014 / 1208 Last » Next »