10988 search results - page 371 / 2198 » Algorithmic Folding Complexity |
165
Voted
PR
2008
15 years 4 months ago
2008
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
126
click to vote
JCP
2007
15 years 4 months ago
2007
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
238
click to vote
GIS
2009
ACM
16 years 6 months ago
2009
ACM
A common problem in moving object databases (MOD) is the reconstruction of a trajectory from a trajectory sample (i.e., a finite sequence of time-space points). A typical solution...
158
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
141
click to vote
ICRA
2006
IEEE
15 years 11 months ago
2006
IEEE
— Robotics technology promises an enhanced way of performing off-pump coronary artery bypass graft (CABG) surgery. In the robotic-assisted CABG surgery, surgeon performs the oper...