75 search results - page 8 / 15 » Definability of Combinatorial Functions and Their Linear Rec... |
ALT
2006
Springer
14 years 5 months ago
2006
Springer
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
DEXA
2008
Springer
13 years 10 months ago
2008
Springer
Recently, a variety of workflow patterns has been proposed focusing on specific aspects like control flow, data flow, and resource assignments. Though these patterns are relevant f...
SIAMCOMP
2002
13 years 8 months ago
2002
Lucas chains are a special type of addition chains satisfying an extra condition: for the representation ak = aj + ai of each element ak in the chain, the difference aj - ai must a...
BMCBI
2008
13 years 8 months ago
2008
Background: Modern sequencing technologies allow rapid sequencing and bioinformatic analysis of genomes and metagenomes. With every new sequencing project a vast number of new pro...
CVPR
2000
IEEE
14 years 4 days ago
2000
IEEE
This paper addresses the derivation of likelihood functions and confidence bounds for problems involving overdetermined linear systems with noise in all measurements, often referr...