719 search results - page 99 / 144 » Solving Sparse Linear Constraints |
77
Voted
SIGGRAPH
2000
ACM
15 years 3 months ago
2000
ACM
We present a method for creating texture over an arbitrary surface mesh using an example 2D texture. The approach is to identify interesting regions (texture patches) in the 2D ex...
SC
1994
ACM
15 years 3 months ago
1994
ACM
In recent years, interior point algorithms have been used successfully for solving mediumto large-size linear programming LP problems. In this paper we describe a highly parallel ...
NAA
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. The convergence of Monte Carlo method for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers kno...
JMLR
2006
14 years 11 months ago
2006
While classical kernel-based learning algorithms are based on a single kernel, in practice it is often desirable to use multiple kernels. Lanckriet et al. (2004) considered conic ...
SIAMAM
2008
14 years 11 months ago
2008
We consider the problem of calculating resonance frequencies and radiative losses of an optical resonator. The optical resonator is in the form of a thin membrane with variable die...