4843 search results - page 188 / 969 » The Shortcut Problem - Complexity and Approximation |
125
click to vote
CPM
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
146
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
128
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
111
Voted
NIPS
2008
15 years 4 months ago
2008
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
114
click to vote
WSC
2004
15 years 4 months ago
2004
Monte Carlo simulation can be readily applied to asset pricing problems with multiple state variables and possible path dependencies because convergence of Monte Carlo methods is ...