Sciweavers

2555 search results - page 510 / 511
» Putting complex systems to work
Sort
View
DAC
2011
ACM
12 years 7 months ago
Supervised design space exploration by compositional approximation of Pareto sets
Technology scaling allows the integration of billions of transistors on the same die but CAD tools struggle in keeping up with the increasing design complexity. Design productivit...
Hung-Yi Liu, Ilias Diakonikolas, Michele Petracca,...
IACR
2011
155views more  IACR 2011»
12 years 7 months ago
Terminating BKZ
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
11 years 9 months ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor
SIGIR
2012
ACM
11 years 9 months ago
A subjunctive exploratory search interface to support media studies researchers
Media studies concerns the study of production, content, and/or reception of various types of media. Today’s continuous production and storage of media is changing the way media...
Marc Bron, Jasmijn van Gorp, Frank Nack, Maarten d...
SAS
2012
Springer
208views Formal Methods» more  SAS 2012»
11 years 9 months ago
Finding Non-terminating Executions in Distributed Asynchronous Programs
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
Michael Emmi, Akash Lal