412 search results - page 58 / 83 » A New Proof of the F5 Algorithm |
110
click to vote
FUN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
COCO
2010
Springer
15 years 1 months ago
2010
Springer
—We prove new lower bounds in the area of property testing of boolean functions. Specifically, we study the problem of testing whether a boolean function f is isomorphic to a ...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
WECWIS
2008
IEEE
15 years 4 months ago
2008
IEEE
Today’s development and provision of commercially used Web services has shifted from providing static and predefined functionality to highly configurable services that can be ...
IAT
2007
IEEE
15 years 4 months ago
2007
IEEE
Here we revisit ADOPT-ing and bring two new contributions. One contribution consists of developing variations on the algorithms keeping the improvement in length of chain of causa...