Sciweavers

117 search results - page 2 / 24
» The Potential of Computation Regrouping for Improving Locali...
Sort
View
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
13 years 3 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani
ICS
2010
Tsinghua U.
13 years 7 months ago
Timing local streams: improving timeliness in data prefetching
Data prefetching technique is widely used to bridge the growing performance gap between processor and memory. Numerous prefetching techniques have been proposed to exploit data pa...
Huaiyu Zhu, Yong Chen, Xian-He Sun
CLOR
2006
13 years 9 months ago
Object Detection and Localization Using Local and Global Features
Traditional approaches to object detection only look at local pieces of the image, whether it be within a sliding window or the regions around an interest point detector. However, ...
Kevin P. Murphy, Antonio B. Torralba, Daniel Eaton...
CVPR
2012
IEEE
11 years 7 months ago
Image matching using local symmetry features
We present a new technique for extracting local features from images of architectural scenes, based on detecting and representing local symmetries. These new features are motivate...
Daniel Cabrini Hauagge, Noah Snavely
CVPR
2011
IEEE
13 years 1 months ago
Using Global Bag of Features Models in Random Fields for Joint Categorization and Segmentation of Objects
We propose to bridge the gap between Random Field (RF) formulations for joint categorization and segmentation (JCaS), which model local interactions among pixels and superpixels, ...
Dheeraj Singaraju, René, Vidal