6142 search results - page 468 / 1229 » The Complexity of Partition Functions |
175
Voted
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
300
Voted
POPL
2006
ACM
16 years 7 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
173
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We address the problem of foothold selection in robotic legged locomotion over very rough terrain. The difficulty of the problem we address here is comparable to that of human...
181
Voted
SMI
2005
IEEE
16 years 13 days ago
2005
IEEE
Recent research on point-based surface representations suggests that point sets may be a viable alternative to parametric surface representations in applications where the topolog...
197
click to vote
ECML
2003
Springer
16 years 2 days ago
2003
Springer
We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of exampl...