Sciweavers

15485 search results - page 386 / 3097
» Computing Optimal Subsets
Sort
View
CVPR
2011
IEEE
14 years 10 months ago
Supervised Hypergraph Labeling
We address the problem of labeling individual datapoints given some knowledge about (small) subsets or groups of them. The knowledge we have for a group is the likelihood value fo...
Toufiq Parag, Ahmed Elgammal
CORR
2012
Springer
183views Education» more  CORR 2012»
14 years 2 months ago
Learning Determinantal Point Processes
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
Alex Kulesza, Ben Taskar
VSTTE
2012
Springer
14 years 2 months ago
Infeasible Code Detection
A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection o...
Cristiano Bertolini, Martin Schäf, Pascal Sch...
JMLR
2012
13 years 9 months ago
Structured Output Learning with High Order Loss Functions
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
Daniel Tarlow, Richard S. Zemel
CVPR
2012
IEEE
13 years 9 months ago
Scalable k-NN graph construction for visual descriptors
The k-NN graph has played a central role in increasingly popular data-driven techniques for various learning and vision tasks; yet, finding an efficient and effective way to con...
Jing Wang, Jingdong Wang, Gang Zeng, Zhuowen Tu, R...