Sciweavers

536 search results - page 99 / 108
» Some Lower Bounds for the Complexity of Continuation Methods
Sort
View
SIGADA
2005
Springer
14 years 25 days ago
Temporal skeletons for verifying time
This paper presents an intermediate notation used in a framework for verification of real-time properties. The framework aims at overcoming the need for the framework user to hav...
Gustaf Naeser, Kristina Lundqvist, Lars Asplund
MMMACNS
2001
Springer
13 years 11 months ago
Generalized Oblivious Transfer Protocols Based on Noisy Channels
The main cryptographic primitives (Bit Commitment (BC) and Oblivious Transfer (OT) protocols) based on noisy channels have been considered in [1] for asymptotic case. Non-asymptoti...
Valeri Korjik, Kirill Morozov
RT
1999
Springer
13 years 11 months ago
Decoupling Polygon Rendering from Geometry using Rasterization Hardware
The dramatically increasing size of polygonal models resulting from 3D scanning devices and advanced modeling techniques requires new approaches to reduce the load of geometry tran...
Rüdiger Westermann, Ove Sommer, Thomas Ertl
VIS
2008
IEEE
192views Visualization» more  VIS 2008»
14 years 8 months ago
Smooth Surface Extraction from Unstructured Point-based Volume Data Using PDEs
Abstract--Smooth surface extraction using partial differential equations (PDEs) is a well-known and widely used technique for visualizing volume data. Existing approaches operate o...
Paul Rosenthal, Lars Linsen
PODS
2008
ACM
128views Database» more  PODS 2008»
14 years 7 months ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren