Sciweavers

1299 search results - page 176 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
FOCS
2006
IEEE
15 years 3 months ago
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
Niv Buchbinder, Joseph Naor
AAAI
2012
13 years 5 days ago
Learning Games from Videos Guided by Descriptive Complexity
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speci...
Lukasz Kaiser
DAC
2005
ACM
15 years 10 months ago
A quasi-convex optimization approach to parameterized model order reduction
In this paper an optimization based model order reduction (MOR) framework is proposed. The method involves setting up a quasiconvex program that explicitly minimizes a relaxation ...
Kin Cheong Sou, Alexandre Megretski, Luca Daniel
MFCS
2007
Springer
15 years 4 months ago
Structural Analysis of Gapped Motifs of a String
Abstract. We investigate the structure of the set of gapped motifs (repeated patterns with don’t cares) of a given string of symbols. A natural equivalence classification is int...
Esko Ukkonen
CRV
2006
IEEE
223views Robotics» more  CRV 2006»
15 years 3 months ago
Disparity Map Estimation Using A Total Variation Bound
This paper describes a new variational method for estimating disparity from stereo images. The stereo matching problem is formulated as a convex programming problem in which an ob...
Wided Miled, Jean-Christophe Pesquet