4342 search results - page 596 / 869 » Improved Algorithms for Optimal Embeddings |
157
click to vote
IFIP
2004
Springer
15 years 11 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
166
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
PAC-MDP algorithms approach the exploration-exploitation problem of reinforcement learning agents in an effective way which guarantees that with high probability, the algorithm pe...
110
Voted
ICASSP
2010
IEEE
15 years 5 months ago
2010
IEEE
Empirical filter designs generalize relationships inferred from training data to effect realistic solutions that conform well to the human visual system. Complex algorithms invol...
114
click to vote
ICPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Most existing sensor planning algorithms find it difficult to tackle the discrepancy between a PTZ camera's limited instant field of view (FOV) and panoramic achievable FOV. ...
129
click to vote
WALCOM
2010
IEEE
16 years 16 days ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...