Sciweavers

65 search results - page 1 / 13
» Nature Reserve Selection Problem: A Tight Approximation Algo...
Sort
View
TCBB
2008
73views more  TCBB 2008»
13 years 4 months ago
Nature Reserve Selection Problem: A Tight Approximation Algorithm
The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set...
Magnus Bordewich, Charles Semple
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
13 years 10 months ago
Communication-Aware Processor Allocation for Supercomputers
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
Michael A. Bender, David P. Bunde, Erik D. Demaine...
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 5 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
11 years 7 months ago
The shifting sands algorithm
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
Andrew McGregor, Paul Valiant
CSDA
2004
105views more  CSDA 2004»
13 years 4 months ago
Computational aspects of algorithms for variable selection in the context of principal components
Variable selection consists in identifying a k-subset of a set of original variables that is optimal for a given criterion of adequate approximation to the whole data set. Several...
Jorge Cadima, J. Orestes Cerdeira, Manuel Minhoto