21324 search results - page 478 / 4265 » Making the case for computing |
144
click to vote
NA
2006
15 years 7 months ago
2006
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
187
click to vote
IFM
2010
Springer
2010
Springer
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
15 years 5 months ago
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
205
click to vote
CRYPTO
2012
Springer
13 years 9 months ago
2012
Springer
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
210
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We derive algorithms for finding a nonnegative n-dimensional tensor factorization (n-NTF) which includes the non-negative matrix factorization (NMF) as a particular case when n = ...
151
click to vote
SIGMOD
2001
ACM
16 years 7 months ago
2001
ACM
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...