Sciweavers

356 search results - page 28 / 72
» Solving the Small Sample Size Problem of LDA
Sort
View
TON
2002
86views more  TON 2002»
13 years 7 months ago
Efficient randomized web-cache replacement schemes using samples from past eviction times
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...
Konstantinos Psounis, Balaji Prabhakar
WWW
2005
ACM
14 years 8 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
BMCBI
2010
80views more  BMCBI 2010»
13 years 7 months ago
Sampling the conformation of protein surface residues for flexible protein docking
Background: The problem of determining the physical conformation of a protein dimer, given the structures of the two interacting proteins in their unbound state, is a difficult on...
Patricia Francis-Lyon, Shengyin Gu, Joel Hass, Nin...
SAGA
2005
Springer
14 years 1 months ago
Dynamic Facility Location with Stochastic Demands
Abstract. In this paper, a Stochastic Dynamic Facility Location Problem (SDFLP) is formulated. In the first part, an exact solution method based on stochastic dynamic programming ...
Martin Romauch, Richard F. Hartl
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
14 years 5 days ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom