Sciweavers

3819 search results - page 178 / 764
» Simple Easy Terms
Sort
View
166
Voted
COMBINATORICS
2006
119views more  COMBINATORICS 2006»
15 years 7 months ago
Relaxations of Ore's Condition on Cycles
A simple, undirected 2-connected graph G of order n belongs to class O(n,), 0, if 2 = n - . It is well known (Ore's theorem) that G is hamiltonian if = 0, in which case the 2...
Ahmed Ainouche
AAIP
2009
15 years 4 months ago
Synthesis of Functions Using Generic Programming
Abstract. This paper describes a very flexible way to synthesize functions matching a given predicate. This can be used to find general recursive functions or -terms obeying an inp...
Pieter W. M. Koopman, Rinus Plasmeijer
173
Voted
ICLP
1991
Springer
15 years 10 months ago
{log}: A Logic Programming Language with Finite Sets
An extended logic programming language embodying sets is developed in successive stages, introducing at each stage simple set dictions and operations, and discussing their operati...
Agostino Dovier, Eugenio G. Omodeo, Enrico Pontell...
177
Voted
LISP
2006
77views more  LISP 2006»
15 years 7 months ago
Expressing combinatory reduction systems derivations in the rewriting calculus
The last few years have seen the development of the rewriting calculus (also called rho-calculus or -calculus) that uniformly integrates first-order term rewriting and the -calculu...
Clara Bertolissi, Horatiu Cirstea, Claude Kirchner
234
Voted
ECCV
2006
Springer
16 years 9 months ago
A Fast Approximation of the Bilateral Filter Using a Signal Processing Approach
The bilateral filter is a nonlinear filter that smoothes a signal while preserving strong edges. It has demonstrated great effectiveness for a variety of problems in computer visio...
Frédo Durand, Sylvain Paris