Sciweavers

431 search results - page 48 / 87
» Implementing the maximum of monotone algorithms
Sort
View
IISWC
2009
IEEE
15 years 4 months ago
Phoenix rebirth: Scalable MapReduce on a large-scale shared-memory system
Abstract—Dynamic runtimes can simplify parallel programming by automatically managing concurrency and locality without further burdening the programmer. Nevertheless, implementin...
Richard M. Yoo, Anthony Romano, Christos Kozyrakis
3DPVT
2006
IEEE
176views Visualization» more  3DPVT 2006»
15 years 3 months ago
Belief Propagation for Panorama Generation
We present an algorithm for generating panoramic images of complex scenes from a multi-sensor camera. We further present a programmable graphics hardware implementation to process...
Alan Brunton, Chang Shu
SAC
2008
ACM
14 years 9 months ago
PHALANX: a graph-theoretic framework for test case prioritization
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...
Murali Krishna Ramanathan, Mehmet Koyutürk, A...
CVPR
1997
IEEE
15 years 12 months ago
Disparity Component Matching for Visual Correspondence
We present a method for computing dense visual correspondence based on general assumptions about scene geometry. Our algorithm does not rely on correlation, and uses a variable re...
Yuri Boykov, Olga Veksler, Ramin Zabih
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
15 years 4 months ago
3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit
The study of hashing is closely related to the analysis of balls and bins; items are hashed to memory locations much as balls are thrown into bins. In particular, Azar et. al. [2] ...
Eric Lehman, Rina Panigrahy