Sciweavers

780 search results - page 130 / 156
» Reasoning about sets using redescription mining
Sort
View
FPGA
2009
ACM
180views FPGA» more  FPGA 2009»
14 years 5 months ago
Scalable don't-care-based logic optimization and resynthesis
We describe an optimization method for combinational and sequential logic networks, with emphasis on scalability and the scope of optimization. The proposed resynthesis (a) is cap...
Alan Mishchenko, Robert K. Brayton, Jie-Hong Rolan...
CSE
2009
IEEE
14 years 5 months ago
Modeling User Perception of Interaction Opportunities for Effective Teamwork
—This paper presents a model of collaborative decision-making for groups that involve people and computer agents. The model distinguishes between actions relating to participants...
Ece Kamar, Ya'akov Gal, Barbara J. Grosz
CRYPTO
2009
Springer
150views Cryptology» more  CRYPTO 2009»
14 years 5 months ago
Short and Stateless Signatures from the RSA Assumption
We present the first signature scheme which is “short”, stateless and secure under the RSA assumption in the standard model. Prior short, standard model signatures in the RSA...
Susan Hohenberger, Brent Waters
LADS
2007
Springer
14 years 5 months ago
Facilitating Agent Development in Open Distributed Systems
One of the main reasons about the success of the Web is that many “regular users” are able to create Web pages that, using hyperlinks, incrementally extend both the size and th...
Mauro Gaspari, Davide Guidi
ACMMSP
2006
ACM
257views Hardware» more  ACMMSP 2006»
14 years 5 months ago
Memory models for open-nested transactions
Open nesting provides a loophole in the strict model of atomic transactions. Moss and Hosking suggested adapting open nesting for transactional memory, and Moss and a group at Sta...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha