1632 search results - page 208 / 327 » Sublinear Time Algorithms for Metric Space Problems |
123
click to vote
ICRA
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
136
click to vote
JCM
2008
15 years 4 months ago
2008
With the feature size of semiconductor technology reducing and intellectual properties (IP) cores increasing, on chip communication architectures have a great influence on the perf...
138
click to vote
WEBI
2009
Springer
15 years 10 months ago
2009
Springer
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
135
click to vote
DCC
1998
IEEE
15 years 8 months ago
1998
IEEE
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
133
click to vote
LKR
2008
15 years 5 months ago
2008
Abstract. For clustering problems, many studies use just MAP assignments to show clustering results instead of using whole samples from a MCMC sampler. This is because it is not st...