Sciweavers

331 search results - page 14 / 67
» Comparing Reductions to NP-Complete Sets
Sort
View
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
13 years 11 months ago
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
Leonardo Ribeiro, Theo Härder
VLDB
2004
ACM
103views Database» more  VLDB 2004»
14 years 22 days ago
Distributed Set Expression Cardinality Estimation
We consider the problem of estimating set-expression cardinality in a distributed streaming environment where rapid update streams originating at remote sites are continually tran...
Abhinandan Das, Sumit Ganguly, Minos N. Garofalaki...
TSP
2008
94views more  TSP 2008»
13 years 7 months ago
Cross-Entropy-Based Sign-Selection Algorithms for Peak-to-Average Power Ratio Reduction of OFDM Systems
Sign-selection uses a set of subcarrier signs to reduce the peak-to-average power ratio (PAR) of orthogonal-frequency-division multiplexing (OFDM). However, the computational compl...
Luqing Wang, Chintha Tellambura
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
14 years 7 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...
VLDB
2000
ACM
229views Database» more  VLDB 2000»
13 years 11 months ago
Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces
Many emerging application domains require database systems to support efficient access over highly multidimensional datasets. The current state-of-the-art technique to indexing hi...
Kaushik Chakrabarti, Sharad Mehrotra