Sciweavers

9405 search results - page 1253 / 1881
» Computing a Model of Set Theory
Sort
View
CONCUR
2010
Springer
15 years 8 months ago
Simulation Distances
Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by realvalued distance functions between systems, wher...
Pavol Cerný, Thomas A. Henzinger, Arjun Rad...
CORR
2008
Springer
167views Education» more  CORR 2008»
15 years 7 months ago
Fast k Nearest Neighbor Search using GPU
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...
Vincent Garcia, Eric Debreuve, Michel Barlaud
IANDC
2010
141views more  IANDC 2010»
15 years 5 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner
TOMACS
2010
182views more  TOMACS 2010»
15 years 5 months ago
State-dependent importance sampling for a Jackson tandem network
This paper considers importance sampling as a tool for rare-event simulation. The focus is on estimating the probability of overflow in the downstream queue of a Jacksonian two-n...
Denis I. Miretskiy, Werner R. W. Scheinhardt, Mich...
ICFP
2012
ACM
13 years 9 months ago
Introspective pushdown analysis of higher-order programs
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
Christopher Earl, Ilya Sergey, Matthew Might, Davi...
« Prev « First page 1253 / 1881 Last » Next »