Sciweavers

5331 search results - page 235 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
WWW
2009
ACM
14 years 2 months ago
The slashdot zoo: mining a social network with negative edges
We analyse the corpus of user relationships of the Slashdot technology news site. The data was collected from the Slashdot Zoo feature where users of the website can tag other user...
J. Kunegis, A. Lomatzsch, and C. Bauckhage
STACS
2005
Springer
16 years 1 days ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
SIAMJO
2002
142views more  SIAMJO 2002»
15 years 6 months ago
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
Alessio Massaro, Marcello Pelillo, Immanuel M. Bom...
MM
2006
ACM
175views Multimedia» more  MM 2006»
16 years 16 days ago
The challenge problem for automated detection of 101 semantic concepts in multimedia
We introduce the challenge problem for generic video indexing to gain insight in intermediate steps that affect performance of multimedia analysis methods, while at the same time...
Cees Snoek, Marcel Worring, Jan van Gemert, Jan-Ma...
CVPR
2012
IEEE
13 years 9 months ago
Complex loss optimization via dual decomposition
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable performance measures. Structured prediction is a commo...
Mani Ranjbar, Arash Vahdat, Greg Mori