Sciweavers

7006 search results - page 317 / 1402
» Approximation Algorithms
Sort
View
CPM
1999
Springer
141views Combinatorics» more  CPM 1999»
15 years 8 months ago
Approximate Periods of Strings
The study of approximately periodic strings is relevant to diverse applications such as molecular biology, data compression, and computer-assisted music analysis. Here we study di...
Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park,...
AAAI
2007
15 years 6 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
132
Voted
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
15 years 5 months ago
An exact subexponential-time lattice algorithm for Asian options
Asian options are path-dependent derivatives. How to price them efficiently and accurately has been a longstanding research and practical problem. Asian options can be priced on t...
Tian-Shyr Dai, Yuh-Dauh Lyuu
CPM
2009
Springer
121views Combinatorics» more  CPM 2009»
15 years 10 months ago
LCS Approximation via Embedding into Local Non-repetitive Strings
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
Gad M. Landau, Avivit Levy, Ilan Newman
153
Voted
TCS
2008
15 years 3 months ago
Generalized approximate counting revisited
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
Guy Louchard, Helmut Prodinger