681 search results - page 60 / 137 » General Polynomial Time Decomposition Algorithms |
116
click to vote
TSP
2008
15 years 11 days ago
2008
This paper introduces a general and axiomatic approach to linear signal processing (SP) that we refer to as the algebraic signal processing theory (ASP). Basic to ASP is the linear...
102
click to vote
COMPGEOM
2004
ACM
15 years 6 months ago
2004
ACM
Models of forest ecosystems are needed to understand how climate and land-use change can impact biodiversity. In this paper we describe an individual-based, spatially-explicit for...
95
Voted
CORR
2008
Springer
15 years 17 days ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
107
click to vote
ESA
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
81
Voted
CPM
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...