Sciweavers

895 search results - page 66 / 179
» Approximate convex decomposition
Sort
View
CVPR
2012
IEEE
13 years 7 days 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
EDBT
2006
ACM
121views Database» more  EDBT 2006»
15 years 10 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin
SIGECOM
2006
ACM
128views ECommerce» more  SIGECOM 2006»
15 years 3 months ago
Controlling a supply chain agent using value-based decomposition
We present and evaluate the design of Deep Maize, our entry in the 2005 Trading Agent Competition Supply Chain Management scenario. The central idea is to decompose the problem by...
Christopher Kiekintveld, Jason Miller, Patrick R. ...
IEEEMSP
2002
IEEE
15 years 2 months ago
An optimal shape encoding scheme using skeleton decomposition
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...
ICML
1994
IEEE
15 years 1 months ago
A Modular Q-Learning Architecture for Manipulator Task Decomposition
Compositional Q-Learning (CQ-L) (Singh 1992) is a modular approach to learning to performcomposite tasks made up of several elemental tasks by reinforcement learning. Skills acqui...
Chen K. Tham, Richard W. Prager