Sciweavers

1021 search results - page 58 / 205
» Fast Approximate PCPs
Sort
View
CIKM
2003
Springer
15 years 7 months ago
Dimensionality reduction using magnitude and shape approximations
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
15 years 3 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
FUZZIEEE
2007
IEEE
15 years 8 months ago
Fuzzy Approximation for Convergent Model-Based Reinforcement Learning
— Reinforcement learning (RL) is a learning control paradigm that provides well-understood algorithms with good convergence and consistency properties. Unfortunately, these algor...
Lucian Busoniu, Damien Ernst, Bart De Schutter, Ro...
EDBT
2002
ACM
188views Database» more  EDBT 2002»
16 years 2 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
15 years 6 months ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...