2168 search results - page 237 / 434 » Randomized Algorithms and Complexity Theory |
111
Voted
APIN
2002
15 years 3 months ago
2002
This paper proposes a few steps to escape structured extensive representations for objects, in the context of evolutionary Topological Optimum Design (TOD) problems: early results ...
136
Voted
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
134
Voted
PODS
2010
ACM
15 years 8 months ago
2010
ACM
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
129
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-inter...
130
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equation. ...