Sciweavers

2434 search results - page 213 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
EOR
2010
110views more  EOR 2010»
15 years 4 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
16 years 4 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
STOC
2003
ACM
124views Algorithms» more  STOC 2003»
16 years 4 months ago
Extractors: optimal up to constant factors
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wi...
BMCBI
2004
97views more  BMCBI 2004»
15 years 4 months ago
Performance of a genetic algorithm for mass spectrometry proteomics
Background: Recently, mass spectrometry data have been mined using a genetic algorithm to produce discriminatory models that distinguish healthy individuals from those with cancer...
Neal O. Jeffries
PROPERTYTESTING
2010
15 years 2 months ago
Sublinear Algorithms in the External Memory Model
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...