Sciweavers

730 search results - page 39 / 146
» Combinatorics of Monotone Computations
Sort
View
COCOON
2005
Springer
14 years 2 months ago
Conserved Interval Distance Computation Between Non-trivial Genomes
Recently, several studies taking into account the ability for a gene to be absent or to have some copies in genomes have been proposed, as the examplar distance [11, 6] or the gene...
Guillaume Blin, Romeo Rizzi
COCOON
2003
Springer
14 years 1 months ago
The Complexity of Boolean Matrix Root Computation
Abstract. We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as dire...
Martin Kutz
SAC
2004
ACM
14 years 2 months ago
Mining dependence rules by finding largest itemset support quota
In the paper a new data mining algorithm for finding the most interesting dependence rules is described. Dependence rules are derived from the itemsets with support significantly ...
Alexandr A. Savinov
FOCS
2009
IEEE
14 years 3 months ago
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
We extend the “method of multiplicities” to get the following results, of interest in combinatorics and randomness extraction.
Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madh...
DCC
1998
IEEE
13 years 8 months ago
Enumeration, Construction and Random Generation of Block Codes
We discuss some methods for the enumeration, construction and random generation of isometry classes of block codes using methods from algebraic combinatorics.
Harald Fripertinger