Sciweavers

4498 search results - page 335 / 900
» How to Invent Functions
Sort
View
CVPR
2011
IEEE
14 years 10 months ago
Generalized Group Sparse Classifiers with Application in fMRI Brain Decoding
The perplexing effects of noise and high feature dimensionality greatly complicate functional magnetic resonance imaging (fMRI) classification. In this paper, we present a novel f...
Bernard Ng, Rafeef Abugharbieh
EUROCRYPT
2011
Springer
14 years 9 months ago
Semi-homomorphic Encryption and Multiparty Computation
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a se...
Rikke Bendlin, Ivan Damgård, Claudio Orlandi...
ICLP
2011
Springer
14 years 9 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
PODS
2001
ACM
127views Database» more  PODS 2001»
16 years 6 months ago
Optimal Aggregation Algorithms for Middleware
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Ronald Fagin, Amnon Lotem, Moni Naor
MICRO
2009
IEEE
326views Hardware» more  MICRO 2009»
16 years 24 days ago
DDT: design and evaluation of a dynamic program analysis for optimizing data structure usage
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
Changhee Jung, Nathan Clark