Sciweavers

1813 search results - page 173 / 363
» Calculi of Approximation Spaces
Sort
View
MOC
2000
77views more  MOC 2000»
15 years 6 months ago
Locking-free finite elements for the Reissner-Mindlin plate
Two new families of Reissner-Mindlin triangular finite elements are analyzed. One family, generalizing an element proposed by Zienkiewicz and Lefebvre, approximates (for k 1) the ...
Richard S. Falk, Tong Tu
PR
2007
104views more  PR 2007»
15 years 6 months ago
Optimizing resources in model selection for support vector machine
Tuning SVM hyperparameters is an important step in achieving a high-performance learning machine. It is usually done by minimizing an estimate of generalization error based on the...
Mathias M. Adankon, Mohamed Cheriet
IPL
2010
114views more  IPL 2010»
15 years 5 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
TOG
2010
153views more  TOG 2010»
15 years 1 months ago
Content-adaptive parallax barriers: optimizing dual-layer 3D displays using low-rank light field factorization
We optimize automultiscopic displays built by stacking a pair of modified LCD panels. To date, such dual-stacked LCDs have used heuristic parallax barriers for view-dependent imag...
Douglas Lanman, Matthew Hirsch, Yunhee Kim, Ramesh...
AAAI
2011
14 years 6 months ago
Optimal Rewards versus Leaf-Evaluation Heuristics in Planning Agents
Planning agents often lack the computational resources needed to build full planning trees for their environments. Agent designers commonly overcome this finite-horizon approxima...
Jonathan Sorg, Satinder P. Singh, Richard L. Lewis