Sciweavers

5115 search results - page 469 / 1023
» On Randomized Lanczos Algorithms
Sort
View
DAC
2004
ACM
15 years 11 months ago
Probabilistic regression suites for functional verification
Random test generators are often used to create regression suites on-the-fly. Regression suites are commonly generated by choosing several specifications and generating a number o...
Shai Fine, Shmuel Ur, Avi Ziv
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
15 years 11 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir
FPGA
2000
ACM
114views FPGA» more  FPGA 2000»
15 years 11 months ago
Generating highly-routable sparse crossbars for PLDs
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
Guy G. Lemieux, Paul Leventis, David M. Lewis
234
Voted
AAAI
2008
15 years 10 months ago
Feature Selection for Activity Recognition in Multi-Robot Domains
In multi-robot settings, activity recognition allows a robot to respond intelligently to the other robots in its environment. Conditional random fields are temporal models that ar...
Douglas L. Vail, Manuela M. Veloso
AAAI
2006
15 years 9 months ago
The Impact of Balancing on Problem Hardness in a Highly Structured Domain
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
Carlos Ansótegui, Ramón Béjar...