Sciweavers

356 search results - page 36 / 72
» Solving the Small Sample Size Problem of LDA
Sort
View
AAAI
2012
11 years 10 months ago
Lagrangian Relaxation Techniques for Scalable Spatial Conservation Planning
We address the problem of spatial conservation planning in which the goal is to maximize the expected spread of cascades of an endangered species by strategically purchasing land ...
Akshat Kumar, XiaoJian Wu, Shlomo Zilberstein
SIGGRAPH
1997
ACM
13 years 11 months ago
Metropolis light transport
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
Eric Veach, Leonidas J. Guibas
ICPR
2004
IEEE
14 years 8 months ago
Incorporating Prior Knowledge into SVM for Image Retrieval
SVM based image retrieval suffers from the scarcity of labelled samples. In this paper, this problem is solved by incorporating prior knowledge into SVM. Firstly, some prior knowl...
Lei Wang, Ping Xue, Kap Luk Chan
RECOMB
2007
Springer
14 years 8 months ago
Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
Yufeng Wu
DM
2006
128views more  DM 2006»
13 years 7 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck