Sciweavers

1215 search results - page 193 / 243
» Combinatorics
Sort
View
CPM
2007
Springer
222views Combinatorics» more  CPM 2007»
15 years 3 months ago
Computing Exact p-Value for Structured Motif
Extracting motifs from a set of DNA sequences is important in computational biology. Occurrence probability is a common used statistics to evaluate the statistical significance of...
Jing Zhang, Xi Chen, Ming Li
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 3 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella
COMPGEOM
2006
ACM
15 years 3 months ago
Random triangulations of planar point sets
Let S be a finite set of n + 3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the...
Micha Sharir, Emo Welzl
COCOON
2005
Springer
15 years 3 months ago
Complexity and Approximation of Satisfactory Partition Problems
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
COCOON
2005
Springer
15 years 3 months ago
Error-Set Codes and Related Objects
By considering a new metric, Nikov and Nikova defined the class of error-set correcting codes. These codes differ from the errorcorrecting codes in the sense that the minimum dis...
An Braeken, Ventzislav Nikov, Svetla Nikova