Sciweavers

16596 search results - page 3041 / 3320
» Generalized Assignment Problems
Sort
View
RECOMB
2005
Springer
16 years 7 months ago
Improved Duplication Models for Proteome Network Evolution
Protein-protein interaction networks, particularly that of the yeast S. Cerevisiae, have recently been studied extensively. These networks seem to satisfy the small world property ...
Gürkan Bebek, Petra Berenbrink, Colin Cooper,...
CADE
2006
Springer
16 years 7 months ago
CEL - A Polynomial-Time Reasoner for Life Science Ontologies
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
Franz Baader, Carsten Lutz, Boontawee Suntisrivara...
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 7 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
16 years 7 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
ICALP
2009
Springer
16 years 7 months ago
Elimination Graphs
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
Yuli Ye, Allan Borodin
« Prev « First page 3041 / 3320 Last » Next »