20441 search results - page 460 / 4089 » Locally Computable Structures |
159
click to vote
ICASSP
2007
IEEE
16 years 1 months ago
2007
IEEE
There are currently a large number of ‘‘orphan’’ G-protein-coupled receptors (GPCRs) whose endogenous ligands (peptide hormones) are unknown. Identification of these pepti...
152
Voted
ISSAC
2007
Springer
16 years 28 days ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
177
click to vote
ISMIS
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. A model of granular computing (GrC) is proposed by reformulating, re-interpreting, and combining results from rough sets, quotient space theory, and belief functions. Two...
195
click to vote
BIOCOMP
2006
15 years 8 months ago
2006
- The search for structural similarity among proteins can provide valuable insights into their functional mechanisms and their functional relationships. Though the protein 1D seque...
161
click to vote
INFOCOM
2005
IEEE
16 years 11 days ago
2005
IEEE
Abstract— The localization problem is to determine an assignment of coordinates to nodes in a wireless ad-hoc or sensor network that is consistent with measured pairwise node dis...