Sciweavers

2569 search results - page 148 / 514
» Approximate Objects and Approximate Theories
Sort
View
TOG
2008
120views more  TOG 2008»
15 years 6 months ago
Real-time, all-frequency shadows in dynamic scenes
Shadow computation in dynamic scenes under complex illumination is a challenging problem. Methods based on precomputation provide accurate, real-time solutions, but are hard to ex...
Thomas Annen, Zhao Dong, Tom Mertens, Philippe Bek...
ACCV
2010
Springer
15 years 1 months ago
One-Class Classification with Gaussian Processes
Detecting instances of unknown categories is an important task for a multitude of problems such as object recognition, event detection, and defect localization. This paper investig...
Michael Kemmler, Erik Rodner, Joachim Denzler
MOBIHOC
2007
ACM
16 years 6 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
CRYPTO
2009
Springer
154views Cryptology» more  CRYPTO 2009»
16 years 1 months ago
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
Vadim Lyubashevsky, Daniele Micciancio
GECCO
2009
Springer
16 years 1 months ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...