Sciweavers

2950 search results - page 540 / 590
» Computing with Infinitely Many Processes
Sort
View
RSP
2000
IEEE
156views Control Systems» more  RSP 2000»
14 years 1 months ago
Quasi-Static Scheduling of Reconfigurable Dataflow Graphs for DSP Systems
Dataflow programming has proven to be popular for representing applications in rapid prototyping tools for digital signal processing (DSP); however, existing dataflow design tools...
Bishnupriya Bhattacharya, Shuvra S. Bhattacharyya
SIGGRAPH
2000
ACM
14 years 1 months ago
Timewarp rigid body simulation
The traditional high-level algorithms for rigid body simulation work well for moderate numbers of bodies but scale poorly to systems of hundreds or more moving, interacting bodies...
Brian Mirtich
FOCS
1999
IEEE
14 years 1 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
VISUALIZATION
1998
IEEE
14 years 1 months ago
A general method for preserving attribute values on simplified meshes
Many sophisticated solutions have been proposed to reduce the geometric complexity of 3D meshes. A less studied problem is how to preserve on a simplified mesh the detail (e.g. co...
Paolo Cignoni, Claudio Montani, Roberto Scopigno, ...
FQAS
1998
Springer
118views Database» more  FQAS 1998»
14 years 1 months ago
Partial Answers for Unavailable Data Sources
Abstract. Many heterogeneous database system products and prototypes exist today; they will soon be deployed in a wide variety of environments. Most existing systems suffer from an...
Philippe Bonnet, Anthony Tomasic