Sciweavers

873 search results - page 110 / 175
» E-voting: Dependability Requirements and Design for Dependab...
Sort
View
ICML
2007
IEEE
16 years 20 days ago
Efficient inference with cardinality-based clique potentials
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi
HPCA
2001
IEEE
16 years 6 days ago
Differential FCM: Increasing Value Prediction Accuracy by Improving Table Usage Efficiency
Value prediction is a relatively new technique to increase the Instruction Level Parallelism (ILP) in future microprocessors. An important problem when designing a value predictor...
Bart Goeman, Hans Vandierendonck, Koenraad De Boss...
OSDI
2004
ACM
16 years 4 days ago
ksniffer: Determining the Remote Client Perceived Response Time from Live Packet Streams
As dependence on the World Wide Web continues to grow, so does the need for businesses to have quantitative measures of the client perceived response times of their Web services. ...
David P. Olshefski, Jason Nieh, Erich M. Nahum
SOSP
2009
ACM
15 years 8 months ago
Distributed aggregation for data-parallel computing: interfaces and implementations
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...
Yuan Yu, Pradeep Kumar Gunda, Michael Isard
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
15 years 8 months ago
Towards type-theoretic semantics for transactional concurrency
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett