Sciweavers

9405 search results - page 490 / 1881
» Computing a Model of Set Theory
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 11 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
FC
2009
Springer
150views Cryptology» more  FC 2009»
16 years 2 months ago
Privacy-Preserving Information Markets for Computing Statistical Data
Abstract. Consider an “information market” where private and potentially sensitive data are collected, treated as commodity and processed into aggregated information with comme...
Aggelos Kiayias, Bülent Yener, Moti Yung
CGF
2008
201views more  CGF 2008»
15 years 7 months ago
High-Resolution Volumetric Computation of Offset Surfaces with Feature Preservation
We present a new algorithm for the efficient and reliable generation of offset surfaces for polygonal meshes. The algorithm is robust with respect to degenerate configurations and...
Darko Pavic, Leif Kobbelt
SRDS
2010
IEEE
15 years 5 months ago
An Entity-Centric Approach for Privacy and Identity Management in Cloud Computing
Entities (e.g., users, services) have to authenticate themselves to service providers (SPs) in order to use their services. An entity provides personally identifiable information (...
Pelin Angin, Bharat K. Bhargava, Rohit Ranchal, No...
BMCBI
2010
155views more  BMCBI 2010»
15 years 5 months ago
BrEPS: a flexible and automatic protocol to compute enzyme-specific sequence profiles for functional annotation
Background: Models for the simulation of metabolic networks require the accurate prediction of enzyme function. Based on a genomic sequence, enzymatic functions of gene products a...
Constantin Bannert, A. Welfle, C. aus dem Spring, ...