12148 search results - page 156 / 2430 » Generalized Bundle Methods |
132
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
109
click to vote
IEAAIE
2005
Springer
15 years 8 months ago
2005
Springer
The discovery of new and potentially meaningful relationships between concepts in the biomedical literature has attracted the attention of a lot of researchers in text mining. The ...
122
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
110
click to vote
STOC
1999
ACM
15 years 6 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
111
Voted
CISC
2006
Springer
15 years 6 months ago
2006
Springer
This work builds on earlier work by Rogaway at Asiacrypt 2004 on tweakable block cipher (TBC) and modes of operations. Our first contribution is to generalize Rogaway's TBC co...