Sciweavers

154 search results - page 5 / 31
» Algorithms for Implicit Hitting Set Problems
Sort
View
IIS
2004
13 years 11 months ago
Conceptual Clustering Using Lingo Algorithm: Evaluation on Open Directory Project Data
Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search hits list, returned from a search engine. In this paper we present t...
Stanislaw Osinski, Dawid Weiss
CEC
2007
IEEE
14 years 4 months ago
Implicit alternative splicing for genetic algorithms
— In this paper we present a new nature-inspired variation operator for binary encodings in genetic algorithms (GAs). Our method, called implicit alternative splicing (iAS), is r...
Philipp Rohlfshagen, John A. Bullinaria
ICML
2010
IEEE
13 years 7 months ago
Implicit Online Learning
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...
Brian Kulis, Peter L. Bartlett
BMCBI
2008
105views more  BMCBI 2008»
13 years 10 months ago
A gene pattern mining algorithm using interchangeable gene sets for prokaryotes
Background: Mining gene patterns that are common to multiple genomes is an important biological problem, which can lead us to novel biological insights. When family classification...
Meng Hu, Kwangmin Choi, Wei Su, Sun Kim, Jiong Yan...
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 10 months ago
Improved Approximation for Guarding Simple Galleries from the Perimeter
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for bui...
James King, David G. Kirkpatrick