Sciweavers

7596 search results - page 106 / 1520
» Challenges in forensic computing
Sort
View
CVPR
2012
IEEE
13 years 5 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun
CORR
2012
Springer
281views Education» more  CORR 2012»
13 years 11 months ago
Belief Propagation by Message Passing in Junction Trees: Computing Each Message Faster Using GPU Parallelization
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
Lu Zheng, Ole J. Mengshoel, Jike Chong
DAC
2012
ACM
13 years 5 months ago
Self-aware computing in the Angstrom processor
Addressing the challenges of extreme scale computing requires holistic design of new programming models and systems that support those models. This paper discusses the Angstrom pr...
Henry Hoffmann, Jim Holt, George Kurian, Eric Lau,...
125
Voted
IUI
2012
ACM
13 years 11 months ago
Towards recognizing "cool": can end users help computer vision recognize subjective attributes of objects in images?
Recent computer vision approaches are aimed at richer image interpretations that extend the standard recognition of objects in images (e.g., cars) to also recognize object attribu...
William Curran, Travis Moore, Todd Kulesza, Weng-K...
SIGCOMM
2012
ACM
13 years 5 months ago
FairCloud: sharing the network in cloud computing
e network, similar to CPU and memory, is a critical and shared resource in the cloud. However, unlike other resources, it is neither shared proportionally to payment, nor do cl...
Lucian Popa 0002, Gautam Kumar, Mosharaf Chowdhury...