Sciweavers

1368 search results - page 191 / 274
» Generalized Rook Polynomials
Sort
View
COCO
2007
Springer
93views Algorithms» more  COCO 2007»
15 years 11 months ago
S-T Connectivity on Digraphs with a Known Stationary Distribution
We present a deterministic logspace algorithm for solving S-T Connectivity on directed graphs if (i) we are given a stationary distribution of the random walk on the graph in whic...
Kai-Min Chung, Omer Reingold, Salil P. Vadhan
COLT
2007
Springer
15 years 11 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
149
Voted
CP
2007
Springer
15 years 11 months ago
Breaking Value Symmetry
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. We can eliminate such value symmetr...
Toby Walsh
CPM
2007
Springer
101views Combinatorics» more  CPM 2007»
15 years 11 months ago
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
Yufeng Wu, Dan Gusfield
150
Voted
CPM
2007
Springer
102views Combinatorics» more  CPM 2007»
15 years 11 months ago
Non-breaking Similarity of Genomes with Gene Repetitions
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zh...