Sciweavers

356 search results - page 27 / 72
» Solving the Small Sample Size Problem of LDA
Sort
View
FAST
2009
13 years 5 months ago
Sparse Indexing: Large Scale, Inline Deduplication Using Sampling and Locality
We present sparse indexing, a technique that uses sampling and exploits the inherent locality within backup streams to solve for large-scale backup (e.g., hundreds of terabytes) t...
Mark Lillibridge, Kave Eshghi, Deepavali Bhagwat, ...
ICRA
2008
IEEE
167views Robotics» more  ICRA 2008»
14 years 2 months ago
An approximate algorithm for solving oracular POMDPs
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
Nicholas Armstrong-Crews, Manuela M. Veloso
IOR
2006
173views more  IOR 2006»
13 years 7 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
BMCBI
2006
86views more  BMCBI 2006»
13 years 7 months ago
The impact of sample imbalance on identifying differentially expressed genes
Background: Recently several statistical methods have been proposed to identify genes with differential expression between two conditions. However, very few studies consider the p...
Kun Yang, Jianzhong Li, Hong Gao
PVLDB
2008
110views more  PVLDB 2008»
13 years 7 months ago
Online maintenance of very large random samples on flash storage
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
Suman Nath, Phillip B. Gibbons