1753 search results - page 293 / 351 » Dynamic Scan Scheduling |
127
click to vote
SDM
2007
SIAM
15 years 3 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
150
click to vote
FAST
2004
15 years 3 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...
142
click to vote
ANLP
1997
15 years 3 months ago
1997
Identifying the occurrences of proper names in text and the entities they refer to can be a difficult task because of the manyto-many mapping between names and their referents. We...
120
Voted
CVPR
2010
IEEE
15 years 2 months ago
2010
IEEE
Object detection remains an important but challenging task in computer vision. We present a method that combines high accuracy with high efficiency. We adopt simplified forms of...
114
Voted
ISCA
2010
IEEE
15 years 29 days ago
2010
IEEE
Practical cache replacement policies attempt to emulate optimal replacement by predicting the re-reference interval of a cache block. The commonly used LRU replacement policy alwa...