4860 search results - page 266 / 972 » SNPs Problems, Complexity, and Algorithms |
80
Voted
ISCAS
2006
IEEE
15 years 6 months ago
2006
IEEE
— Fast QR decomposition RLS (FQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The FQRD-RLS algorithms do not provide acce...
133
Voted
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
91
Voted
ESA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
107
Voted
TSMC
2008
15 years 16 days ago
2008
This paper describes several ensemble methods that combine multiple different reinforcement learning (RL) algorithms in a single agent. The aim is to enhance learning speed and fin...
123
Voted
JMLR
2010
14 years 7 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...