Sciweavers

1974 search results - page 196 / 395
» On Unbiased Linear Approximations
Sort
View
COMPGEOM
2006
ACM
16 years 19 days ago
How to get close to the median shape
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
Sariel Har-Peled
ISCAS
2005
IEEE
125views Hardware» more  ISCAS 2005»
16 years 7 days ago
A novel algorithm of spatial scalability for scrambled video
Although many researches have investigated transparent scrambling video techniques, an issue of which transcoding relates to downsizing scrambled video without unscrambling has ha...
YuanZhi Zou, Wen Gao
COCOON
2005
Springer
16 years 6 days ago
Interference in Cellular Networks: The Minimum Membership Set Cover Problem
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenho...
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
16 years 1 days ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
185
Voted
CDC
2009
IEEE
180views Control Systems» more  CDC 2009»
15 years 10 months ago
Robustness analysis for Least Squares kernel based regression: an optimization approach
—In kernel based regression techniques (such as Support Vector Machines or Least Squares Support Vector Machines) it is hard to analyze the influence of perturbed inputs on the ...
Tillmann Falck, Johan A. K. Suykens, Bart De Moor