2009 search results - page 392 / 402 » Dense Interest Points |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
CGF
2002
13 years 7 months ago
2002
With the advent of sketch-based methods for shape construction, there's a new degree of power available in the rapid creation of approximate shapes. Sketch [Zeleznik, 1996] s...
COMBINATORICS
2002
13 years 7 months ago
2002
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
MST
2000
13 years 7 months ago
2000
A team of learning machines is a multiset of learning machines. A team is said to successfully learn a concept just in case each member of some nonempty subset, of predetermined s...
AMAI
1999
Springer
13 years 7 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...