Sciweavers

33 search results - page 3 / 7
» Approximating Latin Square Extensions
Sort
View
COMPGEOM
2007
ACM
13 years 11 months ago
Bi-criteria linear-time approximations for generalized k-mean/median/center
We consider the problem of approximating a set P of n points in Rd by a collection of j-dimensional flats, and extensions thereof, under the standard median / mean / center measur...
Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
CG
2004
Springer
13 years 7 months ago
Point cloud surfaces using geometric proximity graphs
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...
Jan Klein, Gabriel Zachmann
ADC
2006
Springer
120views Database» more  ADC 2006»
14 years 1 months ago
Approximate data mining in very large relational data
In this paper we discuss eNERF, an extended version of non-Euclidean relational fuzzy c-means (NERFCM) for approximate clustering in very large (unloadable) relational data. The e...
James C. Bezdek, Richard J. Hathaway, Christopher ...
VLDB
2009
ACM
143views Database» more  VLDB 2009»
14 years 7 months ago
Sampling-based estimators for subset-based queries
We consider the problem of using sampling to estimate the result of an aggregation operation over a subset-based SQL query, where a subquery is correlated to an outer query by a NO...
Shantanu Joshi, Christopher M. Jermaine
ISCAS
2007
IEEE
108views Hardware» more  ISCAS 2007»
14 years 1 months ago
Linear Prediction Based Semi-Blind Channel Estimation for MIMO-OFDM System
— In this paper, a semi-blind channel estimation method is presented for MIMO-OFDM systems. The new method uses the linear prediction for obtaining a blind constraint on the MIMO...
Feng Wan, Wei-Ping Zhu, M. N. S. Swamy