9842 search results - page 370 / 1969 » Problem complexity |
201
click to vote
IWPEC
2004
Springer
16 years 7 days ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
162
click to vote
CP
2003
Springer
16 years 3 days ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
191
click to vote
INFOVIS
2003
IEEE
16 years 5 days ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
155
click to vote
SDM
2010
SIAM
15 years 8 months ago
2010
SIAM
The high computational cost of nonlinear support vector machines has limited their usability for large-scale problems. We propose two novel stochastic algorithms to tackle this pr...
167
click to vote
JCSS
2007
15 years 6 months ago
2007
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is ...