Sciweavers

753 search results - page 136 / 151
» Fragments-based Model Reduction: Some Case Studies
Sort
View
EUROCRYPT
2003
Springer
14 years 25 days ago
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
Ran Canetti, Eyal Kushilevitz, Yehuda Lindell
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
13 years 9 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
MCS
2002
Springer
13 years 7 months ago
Multiclassifier Systems: Back to the Future
Abstract. While a variety of multiple classifier systems have been studied since at least the late 1950's, this area came alive in the 90's with significant theoretical a...
Joydeep Ghosh
ALT
2009
Springer
14 years 4 months ago
Learning from Streams
Abstract. Learning from streams is a process in which a group of learners separately obtain information about the target to be learned, but they can communicate with each other in ...
Sanjay Jain, Frank Stephan, Nan Ye
DATE
2009
IEEE
168views Hardware» more  DATE 2009»
14 years 2 months ago
Selective state retention design using symbolic simulation
Abstract—Addressing both standby and active power is a major challenge in developing System-on-Chip designs for batterypowered products. Powering off sections of logic or memorie...
Ashish Darbari, Bashir M. Al-Hashimi, David Flynn,...