Sciweavers

492 search results - page 28 / 99
» Simplifying Probabilistic Programs Using Computer Algebra
Sort
View
111
Voted
ASPLOS
2006
ACM
15 years 6 months ago
Unbounded page-based transactional memory
Exploiting thread level parallelism is paramount in the multi-core era. Transactions enable programmers to expose such parallelism by greatly simplifying the multi-threaded progra...
Weihaw Chuang, Satish Narayanasamy, Ganesh Venkate...
105
Voted
DCOSS
2010
Springer
15 years 3 months ago
Programming Sensor Networks with State-Centric Services
This paper presents the uDSSP ("micro DSSP") programming model which simplifies the development of distributed sensor network applications that make use of complex in-net...
Andreas Lachenmann, Ulrich Müller, Robert Sug...
MP
1998
83views more  MP 1998»
15 years 3 days ago
A modified layered-step interior-point algorithm for linear programming
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The algorithm accelerates the path following interior-point algorithm and its arithmetic complexity dep...
Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya
IPPS
2009
IEEE
15 years 7 months ago
Generation of Synthetic Floating-Point benchmark circuits
Synthetic Floating-Point (SFP), a synthetic benchmark generator program for floating-point circuits is presented. SFP consists of two independent modules for characterisation and...
T. Chun Pong Chau, S. Man Ho Ho, Philip H. W. Leon...
ICALP
2010
Springer
15 years 2 months ago
From Secrecy to Soundness: Efficient Verification via Secure Computation
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz