Sciweavers

75 search results - page 10 / 15
» Optimal Suffix Tree Construction with Large Alphabets
Sort
View
IPPS
2005
IEEE
14 years 4 months ago
A Performance Comparison of Tree and Ring Topologies in Distributed Systems
A distributed system is a collection of computers that are connected via a communication network. Distributed systems have become commonplace due to the wide availability of low-c...
Min Huang, Brett Bode
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
14 years 4 months ago
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
14 years 4 months ago
Adapting Representation in Genetic Programming
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
Cezary Z. Janikow
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 11 months ago
Explicit capacity-achieving list-decodable codes
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
Venkatesan Guruswami, Atri Rudra
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 11 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani