14 search results - page 2 / 3 » Subsequence Packing: Complexity, Approximation, and Applicat... |
122
Voted
MOC
2010
14 years 8 months ago
2010
We consider the application of a perfectly matched layer (PML) technique to approximate solutions to the elastic wave scattering problem in the frequency domain. The PML is viewed ...
127
Voted
ACL
1997
15 years 2 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
116
Voted
STOC
2003
ACM
16 years 1 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
101
Voted
ICCS
2001
Springer
15 years 5 months ago
2001
Springer
Nowadays, people start to accept fuzzy rule–based systems as flexible and convenient tools to solve a myriad of ill–defined but otherwise (for humans) straightforward tasks s...
127
Voted
ALMOB
2006
15 years 1 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...