356 search results - page 32 / 72 » Solving the Small Sample Size Problem of LDA |
COR
2008
14 years 12 months ago
2008
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
163
click to vote
COMPGEOM
2011
ACM
14 years 3 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
COCOA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
112
click to vote
TOMACS
2002
14 years 11 months ago
2002
Consider the problem of estimating the small probability that the maximum of a random walk exceeds a large threshold, when the process has a negative drift and the underlying rand...
100
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...