Sciweavers

263 search results - page 41 / 53
» Efficient Variants of the ICP Algorithm
Sort
View
MP
2006
87views more  MP 2006»
14 years 11 months ago
Convexity and decomposition of mean-risk stochastic programs
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
Shabbir Ahmed
95
Voted
JMLR
2010
161views more  JMLR 2010»
14 years 6 months ago
Empirical Bernstein Boosting
Concentration inequalities that incorporate variance information (such as Bernstein's or Bennett's inequality) are often significantly tighter than counterparts (such as...
Pannagadatta K. Shivaswamy, Tony Jebara
DLS
2010
204views Languages» more  DLS 2010»
14 years 9 months ago
Alias analysis for optimization of dynamic languages
Dynamic languages such as Python allow programs to be written more easily using high-level constructs such as comprehensions for queries and using generic code. Efficient executio...
Michael Gorbovitski, Yanhong A. Liu, Scott D. Stol...
ATAL
2006
Springer
15 years 3 months ago
Learning to cooperate in multi-agent social dilemmas
In many Multi-Agent Systems (MAS), agents (even if selfinterested) need to cooperate in order to maximize their own utilities. Most of the multi-agent learning algorithms focus on...
Jose Enrique Munoz de Cote, Alessandro Lazaric, Ma...
SMA
1999
ACM
152views Solid Modeling» more  SMA 1999»
15 years 4 months ago
Fast volume-preserving free form deformation using multi-level optimization
We present an efficient algorithm for preserving the total volume of a solids undergoing free-form deformation using discrete level-of-detail representations. Given the boundary r...
Gentaro Hirota, Renee Maheshwari, Ming C. Lin