4860 search results - page 635 / 972 » SNPs Problems, Complexity, and Algorithms |
178
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
194
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Complex network analysis is a growing research area in a wide variety of domains and has recently become closely associated with data, text and web mining. One of the most active ...
191
click to vote
APPROX
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
183
click to vote
BMCBI
2007
2007
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
15 years 6 months ago
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
163
click to vote
COCO
2003
Springer
15 years 12 months ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...