Sciweavers

910 search results - page 182 / 182
» Progressive Principal Component Analysis
Sort
View
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 7 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
APVIS
2009
13 years 7 months ago
Toward effective insight management in visual analytics systems
Although significant progress has been made toward effective insight discovery in visual sense making approaches, there is a lack of effective and efficient approaches to manage t...
Yang Chen, Jing Yang, William Ribarsky
BMCBI
2006
172views more  BMCBI 2006»
13 years 5 months ago
BioWarehouse: a bioinformatics database warehouse toolkit
Background: This article addresses the problem of interoperation of heterogeneous bioinformatics databases. Results: We introduce BioWarehouse, an open source toolkit for construc...
Thomas J. Lee, Yannick Pouliot, Valerie Wagner, Pr...
COR
2006
138views more  COR 2006»
13 years 5 months ago
Deconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problem
Over the last decade and a half, tabu search algorithms for machine scheduling have gained a near-mythical reputation by consistently equaling or establishing state-of-the-art per...
Jean-Paul Watson, Adele E. Howe, L. Darrell Whitle...
CIKM
2011
Springer
12 years 5 months ago
MTopS: scalable processing of continuous top-k multi-query workloads
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
Avani Shastri, Di Yang, Elke A. Rundensteiner, Mat...