Sciweavers

884 search results - page 116 / 177
» Algorithms for Implicit Deformable Models
Sort
View
135
Voted
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
15 years 9 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
137
Voted
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
15 years 8 months ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
103
Voted
AUTOMATICA
2006
64views more  AUTOMATICA 2006»
15 years 2 months ago
On the facet-to-facet property of solutions to convex parametric quadratic programs
In some of the recently-developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regio...
Jørgen Spjøtvold, Eric C. Kerrigan, ...
ICML
2005
IEEE
16 years 3 months ago
Core Vector Regression for very large regression problems
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
Ivor W. Tsang, James T. Kwok, Kimo T. Lai
ECAI
2008
Springer
15 years 4 months ago
Exploiting locality of interactions using a policy-gradient approach in multiagent learning
In this paper, we propose a policy gradient reinforcement learning algorithm to address transition-independent Dec-POMDPs. This approach aims at implicitly exploiting the locality...
Francisco S. Melo