Sciweavers

522 search results - page 17 / 105
» What's a Typical Commit
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
12 years 4 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
WSC
1997
13 years 10 months ago
AutoSched Tutorial
The AutoSchedTM finite capacity planning and scheduling tool helps you increase throughput, reduce in-process inventory, and increase equipment and personnel utilization. AutoSche...
Bill Lindler
JOC
2010
82views more  JOC 2010»
13 years 3 months ago
A Verifiable Secret Shuffle of Homomorphic Encryptions
Abstract. A shuffle consists of a permutation and re-encryption of a set of input ciphertexts. One application of shuffles is to build mix-nets. We suggest an honest verifier zero-...
Jens Groth
ICSE
2009
IEEE-ACM
14 years 9 months ago
How we refactor, and how we know it
Much of what we know about how programmers refactor in the wild is based on studies that examine just a few software projects. Researchers have rarely taken the time to replicate ...
Emerson R. Murphy-Hill, Chris Parnin, Andrew P. Bl...
PERVASIVE
2007
Springer
14 years 2 months ago
Ambient Information Systems: Evaluation in Two Paradigms
We take two paradigms for information systems development, functionalism and social relativism, and apply their assumptions to the evaluation of ambient information systems. Ambie...
Zachary Pousman, John T. Stasko