Sciweavers

492 search results - page 23 / 99
» The number of possibilities for random dating
Sort
View
SPAA
2009
ACM
14 years 9 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
CORR
2011
Springer
176views Education» more  CORR 2011»
13 years 3 months ago
Matched Filtering from Limited Frequency Samples
In this paper, we study a simple correlation-based strategy for estimating the unknown delay and amplitude of a signal based on a small number of noisy, randomly chosen frequency-...
Armin Eftekhari, Justin K. Romberg, Michael B. Wak...
ACSC
2004
IEEE
14 years 11 days ago
Tuning the Collision Test for Power
The collision test is an important statistical test for rejecting poor random number generators. The test simulates the throwing of balls randomly into urns. A problem in applying...
Wai Wan Tsang, Lucas Chi Kwong Hui, K. P. Chow, C....
DATE
2010
IEEE
147views Hardware» more  DATE 2010»
13 years 11 months ago
Detecting/preventing information leakage on the memory bus due to malicious hardware
An increasing concern amongst designers and integrators of military and defense-related systems is the underlying security of the individual microprocessor components that make up ...
Abhishek Das, Gokhan Memik, Joseph Zambreno, Alok ...
DATE
2009
IEEE
90views Hardware» more  DATE 2009»
14 years 3 months ago
Property analysis and design understanding
—Verification is a major issue in circuit and system design. Formal methods like bounded model checking (BMC) can guarantee a high quality of the verification. There are severa...
Ulrich Kühne, Daniel Große, Rolf Drechs...