5100 search results - page 918 / 1020 » The Linear Complexity of a Graph |
139
click to vote
RECOMB
2006
Springer
16 years 4 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
136
click to vote
RECOMB
2002
Springer
16 years 4 months ago
2002
Springer
A recent idea for determining the three-dimensional structure of a protein uses antibody recognition of surface structure and random peptide libraries to map antibody epitope comb...
128
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
131
Voted
QI
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. It is argued that the vector space measures used to measure closeness of market prices to predictors for market prices are invalid because of the observed metric of commo...
147
Voted
DOCENG
2009
ACM
15 years 11 months ago
2009
ACM
In this paper we propose a novel approach to markup, called Extreme Annotational RDF Markup (EARMARK), using RDF and OWL to annotate features in text content that cannot be mapped...