Sciweavers

2899 search results - page 344 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
IJCGA
2006
85views more  IJCGA 2006»
15 years 6 months ago
Some Lower Bounds on Geometric Separability Problems
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...
TCS
2008
15 years 6 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
TIT
1998
81views more  TIT 1998»
15 years 6 months ago
Fast Iterative Coding Techniques for Feedback Channels
Abstract—A class of capacity-achieving, low-complexity, highreliability, variable-rate coding schemes is developed for communication over discrete memoryless channels with noisel...
James M. Ooi, Gregory W. Wornell
ICASSP
2011
IEEE
14 years 10 months ago
Reusing the H.264/AVC deblocking filter for efficient spatio-temporal prediction in video coding
The prediction step is a very important part of hybrid video codecs for effectively compressing video sequences. While existing video codecs predict either in temporal or in spati...
Jürgen Seiler, André Kaup
PODS
2005
ACM
86views Database» more  PODS 2005»
16 years 6 months ago
Multi-structural databases
We introduce the Multi-Structural Database, a new data framework to support efficient analysis of large, complex data sets. An instance of the model consists of a set of data obje...
Ronald Fagin, Ramanathan V. Guha, Ravi Kumar, Jasm...