199 search results - page 4 / 40 » Can Intuition Become Rigorous |
ECCC
2010
13 years 8 months ago
2010
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
FMAM
2010
13 years 6 months ago
2010
: In this paper, we present the experience gained with the participation in a case study in which a novel high-level design language (UML4SOA) was used to produce a service-oriente...
ASM
2008
ASM
13 years 10 months ago
2008
ASM
Abstract. We survey the use of the Abstract State Machines (ASM) method for a rigorous foundation of modeling and validating web services, workflows, interaction patterns and busin...
TCS
2011
13 years 3 months ago
2011
An active learner has a collection of data points, each with a label that is initially hidden but can be obtained at some cost. Without spending too much, it wishes to find a cla...
SIGGRAPH
1998
ACM
14 years 24 days ago
1998
ACM
We describe our experience with a new algorithm for the reconstruction of surfaces from unorganized sample points in IR 3. The algorithm is the first for this problem with provab...