2957 search results - page 583 / 592 » The Complexity of Polynomial-Time Approximation |
161
click to vote
CGF
2007
15 years 3 months ago
2007
We present a novel framework for efficiently computing the indirect illumination in diffuse and moderately glossy scenes using density estimation techniques. Many existing global...
119
click to vote
IDA
2002
Springer
15 years 3 months ago
2002
Springer
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
149
Voted
AI
1998
Springer
15 years 2 months ago
1998
Springer
Task execution in multi-agent environments may require cooperation among agents. Given a set of agents and a set of tasks which they have to satisfy, we consider situations where ...
160
click to vote
CGA
1999
15 years 2 months ago
1999
emsintovirtualenvironments,whileabstracting the modeling process as much as possible. To achieve efficiency,weconcentrateoncullingdynamicalsystems: if the system is not in view, we...
133
click to vote
INFORMS
1998
15 years 2 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...