9842 search results - page 299 / 1969 » Problem complexity |
216
click to vote
LSSC
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
174
click to vote
PR
2008
15 years 6 months ago
2008
It is generally believed that quadratic discriminant analysis (QDA) can better fit the data in practical pattern recognition applications compared to linear discriminant analysis ...
195
click to vote
JMLR
2006
15 years 6 months ago
2006
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
189
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...
156
click to vote
FOCS
2003
IEEE
16 years 2 days ago
2003
IEEE
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...