5344 search results - page 390 / 1069 » Privacy-Preserving Set Operations |
150
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
152
click to vote
SLOGICA
2008
15 years 4 months ago
2008
A generic format for adaptive vague logics is presented. The concrete adaptive vague logics based on this format are able to (1) identify sentences as vague or non-vague in the con...
191
Voted
NETWORKS
2011
14 years 7 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
139
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
In this paper, we address the problem of detecting pedestrians in crowded real-world scenes with severe overlaps. Our basic premise is that this problem is too difficult for any t...
150
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...