Sciweavers

860 search results - page 143 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
EMSOFT
2007
Springer
14 years 1 months ago
Methods for multi-dimensional robustness optimization in complex embedded systems
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
Arne Hamann, Razvan Racu, Rolf Ernst
SPAA
2004
ACM
14 years 1 months ago
Online algorithms for prefetching and caching on parallel disks
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
14 years 18 hour ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin
SENSYS
2009
ACM
14 years 2 months ago
Optimal clock synchronization in networks
Having access to an accurate time is a vital building block in all networks; in wireless sensor networks even more so, because wireless media access or data fusion may depend on i...
Christoph Lenzen, Philipp Sommer, Roger Wattenhofe...
CHI
2005
ACM
14 years 8 months ago
Gait phase effects in mobile interaction
One problem evaluating mobile and wearable devices is that they are used in mobile settings, making it hard to collect usability data. We present a study of tap-based selection of...
Andrew Crossan, Roderick Murray-Smith, Stephen A. ...