Sciweavers

6028 search results - page 846 / 1206
» Randomness as a resource for design
Sort
View
FPL
2000
Springer
119views Hardware» more  FPL 2000»
15 years 10 months ago
A Self-Reconfigurable Gate Array Architecture
Abstract. This paper presents an innovative architecture for a reconfigurable device that allows single cycle context switching and single cycle random access to the unified on-chi...
Reetinder P. S. Sidhu, Sameer Wadhwa, Alessandro M...
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 10 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
HT
1991
ACM
15 years 10 months ago
Implementing Hypertext Database Relationships through Aggregations and Exceptions
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Yoshinori Hara, Arthur M. Keller, Gio Wiederhold
SIGGRAPH
1991
ACM
15 years 10 months ago
Spectrally optimal sampling for distribution ray tracing
Nonuniform sampling of images is a useful technique in computer graphics, because a properly designed pattern of samples can make aliasing take the form of high-frequency random n...
Don P. Mitchell
AAAI
2007
15 years 9 months ago
Using Expectation Maximization to Find Likely Assignments for Solving CSP's
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...