1272 search results - page 59 / 255 » Approximate Parameterized Matching |
158
Voted
LATIN
2004
Springer
15 years 8 months ago
2004
Springer
We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and it is bri...
152
Voted
AAAI
2006
15 years 4 months ago
2006
Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world proble...
113
click to vote
DAC
2005
ACM
16 years 4 months ago
2005
ACM
System-level design methods specifically targeted towards multimedia applications have recently received a lot of attention. Multimedia workloads are known to have a high degree o...
142
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
155
click to vote
FCT
2007
Springer
15 years 7 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...