732 search results - page 29 / 147 » Strongly Non-U-Shaped Learning Results by General Techniques |
PLILP
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
JUCS
2002
13 years 7 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
PAMI
2011
13 years 2 months ago
2011
—In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. The resulting ...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
A statistical database (StatDB) retrieves only aggregate results, as opposed to individual tuples. This paper investigates the construction of a privacy preserving StatDB that can...
IJCAI
2007
13 years 9 months ago
2007
Most existing sketch understanding systems require a closed domain to achieve recognition. This paper describes an incremental learning technique for opendomain recognition. Our s...