9209 search results - page 357 / 1842 » Data Space Randomization |
179
click to vote
MHCI
2007
Springer
16 years 26 days ago
2007
Springer
This paper presents how ad-hoc co-located collaborations can be supported with an arbitrary number of users that only have acces to small-size mobile displays. Our approach is bas...
191
click to vote
GECCO
2004
Springer
16 years 3 days ago
2004
Springer
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
173
click to vote
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
— Mercator is a program that uses hop-limited probes—the same primitive used in traceroute—to infer an Internet map. It uses informed random address probing to carefully expl...
137
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We prove a variant of a Johnson-Lindenstrauss lemma for matrices with circulant structure. This approach allows to minimise the randomness used, is easy to implement and provides ...
166
click to vote
JMIV
2002
15 years 6 months ago
2002
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...