784 search results - page 104 / 157 » Relaxing the Value Restriction |
IJON
2007
13 years 9 months ago
2007
To predict the 100 missing values from a time series of 5000 data points, given for the IJCNN 2004 time series prediction competition, recurrent neural networks (RNNs) are trained...
GIS
2010
ACM
13 years 7 months ago
2010
ACM
Top-k queries are a popular type of query in Wireless Sensor Networks. Typical solutions rely on coordinated root-tonodes and nodes-to-root messages and on maintaining filters at...
IKE
2010
13 years 7 months ago
2010
: Over the years, DataWarehousing has gone through a number of evolutions from a relatively simple reporting database to sophisticated analytical applications such as analyzing cus...
TCC
2009
Springer
14 years 9 months ago
2009
Springer
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
ICS
2010
Tsinghua U.
14 years 6 months ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...