Sciweavers

438 search results - page 82 / 88
» On Perfect Switching Classes
Sort
View
EUROSYS
2010
ACM
14 years 1 months ago
Residue objects: a challenge to web browser security
A complex software system typically has a large number of objects in the memory, holding references to each other to implement an object model. Deciding when the objects should be...
Shuo Chen, Hong Chen, Manuel Caballero
COCO
2005
Springer
130views Algorithms» more  COCO 2005»
13 years 10 months ago
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
Emanuele Viola
BMCBI
2007
178views more  BMCBI 2007»
13 years 8 months ago
SVM clustering
Background: Support Vector Machines (SVMs) provide a powerful method for classification (supervised learning). Use of SVMs for clustering (unsupervised learning) is now being cons...
Stephen Winters-Hilt, Sam Merat
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 7 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
DAC
2012
ACM
11 years 11 months ago
Is dark silicon useful?: harnessing the four horsemen of the coming dark silicon apocalypse
Due to the breakdown of Dennardian scaling, the percentage of a silicon chip that can switch at full frequency is dropping exponentially with each process generation. This utiliza...
Michael B. Taylor