412 search results - page 35 / 83 » A New Proof of the F5 Algorithm |
114
click to vote
LICS
1997
IEEE
15 years 2 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
100
click to vote
ALGORITHMICA
2011
14 years 4 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
136
click to vote
IJRR
2007
14 years 9 months ago
2007
The objective of this paper is to propose a new homography-based approach to image-based visual tracking and servoing. The visual tracking algorithm proposed in the paper is based...
101
click to vote
STACS
2009
Springer
15 years 2 months ago
2009
Springer
ABSTRACT. This paper gives a brief overview of computation models for data stream processing, and it introduces a new model for multi-pass processing of multiple streams, the so-ca...