Sciweavers

240 search results - page 9 / 48
» Maximal Contiguous Degrees
Sort
View
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 8 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
13 years 9 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
ML
2000
ACM
13 years 7 months ago
Maximizing Theory Accuracy Through Selective Reinterpretation
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...
Shlomo Argamon-Engelson, Moshe Koppel, Hillel Walt...
DCC
2003
IEEE
14 years 7 months ago
Some New Maximal Sets of Mutually Orthogonal Latin Squares
Two ways of constructing maximal sets of mutually orthogonal Latin squares are presented. The first construction uses maximal partial spreads in PG(3, 4)\ PG(3, 2) with r lines, wh...
Patrick Govaerts, Dieter Jungnickel, Leo Storme, J...
DC
2010
13 years 7 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer