Sciweavers

1387 search results - page 76 / 278
» Convexity in Discrete Space
Sort
View
JAT
2011
64views more  JAT 2011»
15 years 1 months ago
Two remarks on remotality
We prove that there exists a weakly closed and bounded subset E of c0 which is not remotal from 0, and such that co (E) is remotal from 0. This answers a question of M. Mart´ın ...
Michal Kraus
ICANNGA
2007
Springer
105views Algorithms» more  ICANNGA 2007»
16 years 9 days ago
Reinforcement Learning in Fine Time Discretization
Reinforcement Learning (RL) is analyzed here as a tool for control system optimization. State and action spaces are assumed to be continuous. Time is assumed to be discrete, yet th...
Pawel Wawrzynski
CVPR
2010
IEEE
15 years 11 months ago
Weakly-Supervised Hashing in Kernel Space
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
Yadong Mu, Jialie Shen, Shuicheng Yan
SSIAI
2002
IEEE
15 years 11 months ago
A Wavelet Filter Bank Which Minimizes a Novel Translation Invariant Discrete Uncertainty Measure
We develop a novel measure of joint time-frequency localization applicable to equivalence classes of finite-length discrete signals, which are of increasing importance in modern ...
Peter C. Tay, Joseph P. Havlicek, Victor E. DeBrun...
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
15 years 6 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson