Sciweavers

9842 search results - page 1814 / 1969
» Problem complexity
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 8 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
PPOPP
2012
ACM
13 years 8 months ago
Synchronization views for event-loop actors
The actor model has already proven itself as an interesting concurrency model that avoids issues such as deadlocks and race conditions by construction, and thus facilitates concur...
Joeri De Koster, Stefan Marr, Theo D'Hondt
SIGIR
2012
ACM
13 years 3 months ago
TFMAP: optimizing MAP for top-n context-aware recommendation
In this paper, we tackle the problem of top-N context-aware recommendation for implicit feedback scenarios. We frame this challenge as a ranking problem in collaborative filterin...
Yue Shi, Alexandros Karatzoglou, Linas Baltrunas, ...
CVPR
2012
IEEE
13 years 3 months ago
Bag of textons for image segmentation via soft clustering and convex shift
We propose an unsupervised image segmentation method based on texton similarity and mode seeking. The input image is first convolved with a filter-bank, followed by soft cluster...
Zhiding Yu, Ang Li, Oscar C. Au, Chunjing Xu
103
Voted
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 1 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams
« Prev « First page 1814 / 1969 Last » Next »