Sciweavers

666 search results - page 129 / 134
» When Similar Problems Don't Have Similar Solutions
Sort
View
TCC
2009
Springer
124views Cryptology» more  TCC 2009»
14 years 8 months ago
Universally Composable Multiparty Computation with Partially Isolated Parties
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...
IFIP
2009
Springer
14 years 2 months ago
Trusted Multiplexing of Cryptographic Protocols
Abstract. We present an analysis that determines when it is possible to multiplex a pair of cryptographic protocols. We present a transformation that improves the coverage of this ...
Jay A. McCarthy, Shriram Krishnamurthi
CW
2008
IEEE
14 years 2 months ago
Taxonomy and Implementation of Redirection Techniques for Ubiquitous Passive Haptic Feedback
Traveling through immersive virtual environments (IVEs) by means of real walking is an important activity to increase naturalness of VR-based interaction. However, the size of the...
Frank Steinicke, Gerd Bruder, Luv Kohli, Jason Jer...
ECCB
2008
IEEE
14 years 2 months ago
Connect the dots: exposing hidden protein family connections from the entire sequence tree
Motivation: Mapping of remote evolutionary links is a classic computational problem of much interest. Relating protein families allows for functional and structural inference on u...
Yaniv Loewenstein, Michal Linial
ATAL
2007
Springer
14 years 1 months ago
Sharing experiences to learn user characteristics in dynamic environments with sparse data
This paper investigates the problem of estimating the value of probabilistic parameters needed for decision making in environments in which an agent, operating within a multi-agen...
David Sarne, Barbara J. Grosz