Sciweavers

1206 search results - page 212 / 242
» Convergence analysis of online algorithms
Sort
View
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 8 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
FOCM
2010
108views more  FOCM 2010»
13 years 7 months ago
Iterative Thresholding Meets Free-Discontinuity Problems
Free-discontinuity problems describe situations where the solution of interest is defined by a function and a lower dimensional set consisting of the discontinuities of the funct...
Massimo Fornasier, Rachel Ward
PRIB
2010
Springer
176views Bioinformatics» more  PRIB 2010»
13 years 6 months ago
An On/Off Lattice Approach to Protein Structure Prediction from Contact Maps
Abstract. An important unsolved problem in structural bioinformatics is that of protein structure prediction (PSP), the reconstruction of a biologically plausible three-dimensional...
Stefano Teso, Cristina Di Risio, Andrea Passerini,...
GMP
2006
IEEE
14 years 2 months ago
Subdivision Termination Criteria in Subdivision Multivariate Solvers
Abstract. The need for robust solutions for sets of non-linear multivariate constraints or equations needs no motivation. Subdivision-based multivariate constraint solvers [1–3] ...
Iddo Hanniel, Gershon Elber
CVPR
2008
IEEE
14 years 10 months ago
Visual tracking via incremental Log-Euclidean Riemannian subspace learning
Recently, a novel Log-Euclidean Riemannian metric [28] is proposed for statistics on symmetric positive definite (SPD) matrices. Under this metric, distances and Riemannian means ...
Xi Li, Weiming Hu, Zhongfei Zhang, Xiaoqin Zhang, ...