Sciweavers

2260 search results - page 233 / 452
» A new algorithm for clustering search results
Sort
View
DKE
2007
153views more  DKE 2007»
15 years 6 months ago
Adaptive similarity search in streaming time series with sliding windows
The challenge in a database of evolving time series is to provide efficient algorithms and access methods for query processing, taking into consideration the fact that the databas...
Maria Kontaki, Apostolos N. Papadopoulos, Yannis M...
SDM
2009
SIAM
184views Data Mining» more  SDM 2009»
16 years 3 months ago
DensEst: Density Estimation for Data Mining in High Dimensional Spaces.
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
Emmanuel Müller, Ira Assent, Ralph Krieger, S...
IJFCS
2006
87views more  IJFCS 2006»
15 years 6 months ago
Flexible Music Retrieval in Sublinear Time
Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retr...
Kimmo Fredriksson, Veli Mäkinen, Gonzalo Nava...
ICCAD
1996
IEEE
111views Hardware» more  ICCAD 1996»
15 years 10 months ago
Multi-level spectral hypergraph partitioning with arbitrary vertex sizes
This paper presents a new spectral partitioning formulation which directly incorporates vertex size information. The new formulation results in a generalized eigenvalue problem, a...
Jason Y. Zien, Martine D. F. Schlag, Pak K. Chan
SIGIR
2009
ACM
16 years 1 months ago
Compressing term positions in web indexes
Large search engines process thousands of queries per second on billions of pages, making query processing a major factor in their operating costs. This has led to a lot of resear...
Hao Yan, Shuai Ding, Torsten Suel