7342 search results - page 511 / 1469 » Optimal Language Learning |
236
Voted
JMLR
2012
13 years 10 months ago
2012
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...
254
click to vote
ASPLOS
2011
ACM
14 years 11 months ago
2011
ACM
Graphics processing units (GPUs) provide a low cost platform for accelerating high performance computations. The introduction of new programming languages, such as CUDA and OpenCL...
234
click to vote
MICRO
2009
IEEE
16 years 2 months ago
2009
IEEE
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
226
click to vote
ICALP
2010
Springer
16 years 15 days ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
206
click to vote
VLDB
1987
ACM
15 years 11 months ago
1987
ACM
is at least ae powerful as SQL. Two well known relational query languages that have a sound theoretical foundation are relational algebra and relational calculus. As SQL is more cl...