12194 search results - page 399 / 2439 » cans 2010 |
171
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...
171
click to vote
ITP
2010
15 years 10 months ago
2010
Abstract. We present a new scheme to translate mathematical developments from HOL Light to Coq, where they can be re-used and rechecked. By relying on a carefully chosen embedding ...
197
Voted
RTA
2010
Springer
15 years 10 months ago
2010
Springer
We show that, contrary to the situation in first-order term rewriting, almost none of the usual properties of rewriting are modular for higher-order rewriting, irrespective of the...
165
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
— A method is presented for non-rigid alignment of a source shape to a target shape through estimating and interpolating point-wise correspondences between their surfaces given a...
162
click to vote
DASFAA
2010
IEEE
15 years 10 months ago
2010
IEEE
Abstract. In this paper, we present a theoretical foundation for querying inductive databases, which can accommodate disparate mining tasks. We present a data mining algebra includ...