Sciweavers

264 search results - page 26 / 53
» On the possibility of faster SAT algorithms
Sort
View
SPAA
2009
ACM
15 years 5 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
80
Voted
BMCBI
2008
99views more  BMCBI 2008»
14 years 10 months ago
Multiple organism algorithm for finding ultraconserved elements
Background: Ultraconserved elements are nucleotide or protein sequences with 100% identity (no mismatches, insertions, or deletions) in the same organism or between two or more or...
Scott Christley, Neil F. Lobo, Gregory R. Madey
79
Voted
JSC
2010
155views more  JSC 2010»
14 years 8 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
ICCAD
2002
IEEE
92views Hardware» more  ICCAD 2002»
15 years 7 months ago
ECO algorithms for removing overlaps between power rails and signal wires
Design ECO commonly happens in industry due to constraints or target changes from manufacturing, marketing, reliability, or performance. At each step, designers usually want to mo...
Hua Xiang, Kai-Yuan Chao, D. F. Wong
98
Voted
RECOMB
2007
Springer
15 years 10 months ago
Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
Yufeng Wu