8780 search results - page 116 / 1756 » On the Feasibility of Consistent Computations |
ICA3PP
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Practical implementations of atomically consistent read/write memory service are important building blocks for higher level applications. This is especially true when dat...
FSTTCS
2010
Springer
14 years 8 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
105
click to vote
ACMSE
1995
ACM
15 years 1 months ago
1995
ACM
{ Traditional computer applications have been designed to be run by one user at a time who does some work in a single medium, such as ASCII text, and very little regard has been gi...
COR
2008
14 years 10 months ago
2008
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
162
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
This paper introduces a new shape matching algorithm for computing correspondences between 3D surfaces that have undergone (approximately) isometric deformations. The new approach ...