Sciweavers

204 search results - page 6 / 41
» Parameterized Complexity of Cardinality Constrained Optimiza...
Sort
View
SIGMOD
2007
ACM
136views Database» more  SIGMOD 2007»
14 years 6 months ago
Progressive optimization in a shared-nothing parallel database
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
Wook-Shin Han, Jack Ng, Volker Markl, Holger Kache...
ICIP
1998
IEEE
14 years 8 months ago
Reducing the Computational Complexity of a Map Post-Processing Algorithm for Video Sequences
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
Mark A. Robertson, Robert L. Stevenson
PRL
2010
310views more  PRL 2010»
13 years 5 months ago
A Lagrangian Half-Quadratic approach to robust estimation and its applications to road scene analysis
We consider the problem of fitting linearly parameterized models, that arises in many computer vision problems such as road scene analysis. Data extracted from images usually cont...
Jean-Philippe Tarel, Pierre Charbonnier
SSDBM
2003
IEEE
96views Database» more  SSDBM 2003»
13 years 12 months ago
Space Constrained Selection Problems for Data Warehouses and Pervasive Computing
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
Themistoklis Palpanas, Nick Koudas, Alberto O. Men...
COMPGEOM
2003
ACM
13 years 12 months ago
Updating and constructing constrained delaunay and constrained regular triangulations by flips
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
Jonathan Richard Shewchuk