Sciweavers

183 search results - page 16 / 37
» Complete Minors and Independence Number
Sort
View
COLT
2003
Springer
14 years 24 days ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
CP
2000
Springer
13 years 12 months ago
Random 3-SAT: The Plot Thickens
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
Cristian Coarfa, Demetrios D. Demopoulos, Alfonso ...
EUROPAR
2010
Springer
13 years 7 months ago
A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
Marin Bougeret, Pierre-François Dutot, Klau...
BMCBI
2005
93views more  BMCBI 2005»
13 years 7 months ago
Computing expectation values for RNA motifs using discrete convolutions
Background: Computational biologists use Expectation values (E-values) to estimate the number of solutions that can be expected by chance during a database scan. Here we focus on ...
André Lambert, Matthieu Legendre, Jean-Fred...
WISA
2007
Springer
14 years 1 months ago
Detecting Motifs in System Call Sequences
The search for patterns or motifs in data represents an area of key interest to many researchers. In this paper we present the Motif Tracking Algorithm, a novel immune inspired pat...
William O. Wilson, Jan Feyereisl, Uwe Aickelin