7129 search results - page 888 / 1426 » Approximation Algorithms for Treewidth |
156
Voted
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— A distributed online learning framework for support vector machines (SVMs) is presented and analyzed. First, the generic binary classification problem is decomposed in...
124
Voted
VRST
1997
ACM
15 years 9 months ago
1997
ACM
This paper describes a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the v...
148
click to vote
SIGGRAPH
1993
ACM
15 years 9 months ago
1993
ACM
We introduce a new approach for the computation of viewindependent solutions to the diffuse global illumination problem in polyhedral environments. The approach combines ideas fro...
141
Voted
SIGGRAPH
1994
ACM
15 years 9 months ago
1994
ACM
In this paper we discuss the efficient and accurate incorporation of texture maps into a hierarchical Galerkin radiosity algorithm. This extension of the standard algorithm allows...
151
click to vote
AOSD
2007
ACM
15 years 9 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...