3607 search results - page 359 / 722 » Learning with structured sparsity |
193
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
191
click to vote
ESWS
2008
Springer
15 years 8 months ago
2008
Springer
Exploiting the complex structure of relational data enables to build better models by taking into account the additional information provided by the links between objects. We exten...
154
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
150
click to vote
EMNLP
2007
15 years 8 months ago
2007
It has been widely observed that different NLP applications require different sense granularities in order to best exploit word sense distinctions, and that for many applications ...
170
click to vote
IJCAI
2007
15 years 8 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...