Sciweavers

1814 search results - page 104 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
16 years 6 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
16 years 6 months ago
Dynamic hybrid clustering of bioinformatics by incorporating text mining and citation analysis
To unravel the concept structure and dynamics of the bioinformatics field, we analyze a set of 7401 publications from the Web of Science and MEDLINE databases, publication years 1...
Bart De Moor, Frizo A. L. Janssens, Wolfgang Gl&au...
MOC
2002
131views more  MOC 2002»
15 years 5 months ago
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
Douglas R. Stinson
GECCO
2008
Springer
164views Optimization» more  GECCO 2008»
15 years 7 months ago
Genetic algorithms with local search optimization for protein structure prediction problem
This paper presents a new Genetic Algorithm for Protein Structure Prediction problem in both 2D and 3D hydrophobichydrophilic lattice models, introduced in [1]. Our algorithm evol...
Igor Berenboym, Mireille Avigal
DISOPT
2007
93views more  DISOPT 2007»
15 years 6 months ago
A feasibility pump heuristic for general mixed-integer problems
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
Livio Bertacco, Matteo Fischetti, Andrea Lodi