Sciweavers

989 search results - page 47 / 198
» Approximating the Pareto optimal set using a reduced set of ...
Sort
View
COLT
2010
Springer
13 years 5 months ago
Composite Objective Mirror Descent
We present a new method for regularized convex optimization and analyze it under both online and stochastic optimization settings. In addition to unifying previously known firstor...
John Duchi, Shai Shalev-Shwartz, Yoram Singer, Amb...
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
14 years 9 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei
IGIS
1994
145views GIS» more  IGIS 1994»
13 years 12 months ago
Approximations for a Multi-Step Processing of Spatial Joins
The basic concept for processing spatial joins consists of two steps: First, the spatial join is performed on the minimum bounding rectangles of the objects by using a spatial acce...
Thomas Brinkhoff, Hans-Peter Kriegel
SIBGRAPI
2006
IEEE
14 years 1 months ago
Actively Illuminated Objects using Graph-Cuts
This paper addresses the problem of foreground extraction using active illumination and graph-cut optimization. Our approach starts by detecting image regions that are likely to b...
Asla Medeiros Sá, Marcelo Bernardes Vieira,...
PAMI
2011
13 years 2 months ago
Approximately Global Optimization for Robust Alignment of Generalized Shapes
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
Hongsheng Li, Tian Shen, Xiaolei Huang