9842 search results - page 274 / 1969 » The Complexity of the Matching-Cut Problem |
131
Voted
CGI
2004
IEEE
15 years 8 months ago
2004
IEEE
Rendering geometric models with complex surface materials in arbitrary lighting environments is a challenging problem. In order to relight and render geometries covered with compl...
114
click to vote
SDM
2010
SIAM
15 years 5 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...
132
click to vote
HIS
2008
15 years 5 months ago
2008
Artificial Neural Networks for online learning problems are often implemented with synaptic plasticity to achieve adaptive behaviour. A common problem is that the overall learning...
122
click to vote
JCSS
2007
15 years 4 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 â™...
178
click to vote
FGCS
2002
15 years 4 months ago
2002
As the practice of science moves beyond the single investigator due to the complexity of the problems that now dominate science, large collaborative and multi-institutional teams ...