Sciweavers

920 search results - page 56 / 184
» Computing the Frequency of Partial Orders
Sort
View
PADL
2004
Springer
14 years 3 months ago
Observing Functional Logic Computations
Abstract. A lightweight approach to debugging functional logic programs by observations is presented, implemented for the language Curry. The Curry Object Observation System (COOSy...
Bernd Brassel, Olaf Chitil, Michael Hanus, Frank H...
AMC
2006
145views more  AMC 2006»
13 years 10 months ago
Computing the moments of high dimensional solutions of the master equation
Derived from the Markov character only, the master equation of chemical reactions is an accurate stochastic description of quite general systems in chemistry. Exact solutions of t...
Stefan Engblom
ISBI
2006
IEEE
14 years 4 months ago
A comparative study of popular interpolation and integration methods for use in computed tomography
We compare various popular methods available for projection and backprojection in CT. Assuming linear rays and a simple density integration along them, we consider both line- and ...
Fang Xu, Klaus Mueller
FOCS
2007
IEEE
14 years 4 months ago
Covert Multi-Party Computation
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
Nishanth Chandran, Vipul Goyal, Rafail Ostrovsky, ...
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
13 years 11 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann