Sciweavers

840 search results - page 74 / 168
» The Complexity of the Extended GCD Problem
Sort
View
DATE
1999
IEEE
135views Hardware» more  DATE 1999»
14 years 6 days ago
Combinational Equivalence Checking Using Satisfiability and Recursive Learning
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
João P. Marques Silva, Thomas Glass
SIGGRAPH
1990
ACM
13 years 12 months ago
The accumulation buffer: hardware support for high-quality rendering
Paul Haeberli and Kurt Akeley SiliconGraphicsComputerSystems This paper describes a system architecture that supports realtime generation of complex images, efficient generation o...
Paul Haeberli, Kurt Akeley
DIS
2007
Springer
13 years 11 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
EDBT
2000
ACM
13 years 11 months ago
Materialized View Selection for Multi-Cube Data Models
OLAP applications use precomputation of aggregate data to improve query response time. While this problem has been well-studied in the recent database literature, to our knowledge ...
Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton
OPODIS
2004
13 years 9 months ago
Secure Location Verification Using Radio Broadcast
Secure location verification is a recently stated problem that has a number of practical applications. The problem requires a wireless sensor network to confirm that a potentially...
Adnan Vora, Mikhail Nesterenko