Sciweavers

8196 search results - page 15 / 1640
» Computational Modeling and Complexity Science
Sort
View
TCS
2008
13 years 9 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
CSE
2009
IEEE
14 years 1 months ago
Adapting Privacy-Preserving Computation to the Service Provider Model
There are many applications for Secure Multi-Party Computation (SMC), but practical adoption is still an issue. One reason is that the business model of the application does not m...
Florian Kerschbaum
WG
2007
Springer
14 years 3 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
SIGCSE
2003
ACM
198views Education» more  SIGCSE 2003»
14 years 3 months ago
Computer graphics in undergraduate computational science education
Computer graphics forms an important part of a working scientist’s tools. This may be provided by resources with the scientist’s group or by capabilities of the toolkits that ...
Steve Cunningham, Angela B. Shiflet
CAD
2000
Springer
13 years 9 months ago
Time-critical multiresolution rendering of large complex models
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
Enrico Gobbetti, Eric Bouvier