2127 search results - page 385 / 426 » Computing large matchings fast |
102
click to vote
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
In many scientific applications, significant time is spent tuning codes for a particular highperformance architecture. Tuning approaches range from the relatively nonintrusive (...
112
click to vote
SIGGRAPH
1999
ACM
15 years 4 months ago
1999
ACM
This paper introduces a new process, environment matting, which captures not just a foreground object and its traditional opacity matte from a real-world scene, but also a descrip...
NIXDORF
1992
15 years 3 months ago
1992
We present some quantitative performance measurements for the computing power of Programmable Active Memories (PAM), as introduced by [2]. Based on Field Programmable Gate Array (...
164
click to vote
SIGIR
1992
ACM
15 years 3 months ago
1992
ACM
ct We describe work on the visualization of bibliographic data and, to aid in this task, the application of numerical techniques for multidimensional scaling. Many areas of scienti...
AIPS
2010
15 years 2 months ago
2010
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...