7006 search results - page 1204 / 1402 » Approximation Algorithms |
219
Voted
INFOCOM
1998
IEEE
15 years 10 months ago
1998
IEEE
To support the Internet's explosive growth and expansion into a true integrated services network, there is a need for cost-effective switching technologies that can simultaneo...
175
click to vote
STOC
1990
ACM
15 years 10 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
180
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
In a sparse-representation-based face recognition scheme, the desired dictionary should have good representational power (i.e., being able to span the subspace of all faces) while...
183
click to vote
RSS
2007
15 years 7 months ago
2007
Abstract— This paper proposes a simulation-based active policy learning algorithm for finite-horizon, partially-observed sequential decision processes. The algorithm is tested i...
203
Voted
FAST
2004
15 years 7 months ago
2004
CLOCK is a classical cache replacement policy dating back to 1968 that was proposed as a low-complexity approximation to LRU. On every cache hit, the policy LRU needs to move the a...