Sciweavers

9842 search results - page 274 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
100
Voted
CGI
2004
IEEE
15 years 4 months ago
Fast Environmental Lighting for Local-PCA Encoded BTFs
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...
Gero Müller, Jan Meseth, Reinhard Klein
85
Voted
SDM
2010
SIAM
151views Data Mining» more  SDM 2010»
15 years 2 months ago
Fast Stochastic Frank-Wolfe Algorithms for Nonlinear SVMs
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...
Hua Ouyang, Alexander Gray
104
Voted
HIS
2008
15 years 2 months ago
Neural Plasticity and Minimal Topologies for Reward-Based Learning
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...
Andrea Soltoggio
JCSS
2007
88views more  JCSS 2007»
15 years 15 days ago
Counting lattice vectors
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 â™...
Denis Xavier Charles
147
Voted
FGCS
2002
133views more  FGCS 2002»
15 years 12 days ago
Computational and data Grids in large-scale science and engineering
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 ...
William E. Johnston