Sciweavers

13784 search results - page 203 / 2757
» On Computing Functions with Uncertainty
Sort
View
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 11 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi
ICML
2008
IEEE
14 years 10 months ago
Space-indexed dynamic programming: learning to follow trajectories
We consider the task of learning to accurately follow a trajectory in a vehicle such as a car or helicopter. A number of dynamic programming algorithms such as Differential Dynami...
J. Zico Kolter, Adam Coates, Andrew Y. Ng, Yi Gu, ...
ENTCS
2008
146views more  ENTCS 2008»
13 years 9 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith
AAAI
2012
11 years 11 months ago
MOMDPs: A Solution for Modelling Adaptive Management Problems
In conservation biology and natural resource management, adaptive management is an iterative process of improving management by reducing uncertainty via monitoring. Adaptive manag...
Iadine Chades, Josie Carwardine, Tara G. Martin, S...
SACRYPT
2007
Springer
151views Cryptology» more  SACRYPT 2007»
14 years 3 months ago
Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
The diversity of methods for fast collision search in SHA-1 and similar hash functions makes a comparison of them difficult. The literature is at times very vague on this issue, wh...
Christophe De Cannière, Florian Mendel, Chr...