Sciweavers

340 search results - page 48 / 68
» Clustering with Lower Bound on Similarity
Sort
View
PVLDB
2008
77views more  PVLDB 2008»
14 years 9 months ago
Efficient network aware search in collaborative tagging sites
The popularity of collaborative tagging sites presents a unique opportunity to explore keyword search in a context where query results are determined by the opinion of a network o...
Sihem Amer-Yahia, Michael Benedikt, Laks V. S. Lak...
TON
2008
109views more  TON 2008»
14 years 9 months ago
On hierarchical traffic grooming in WDM networks
Abstract--The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any ...
Bensong Chen, George N. Rouskas, Rudra Dutta
SSDBM
2005
IEEE
115views Database» more  SSDBM 2005»
15 years 3 months ago
Using Multi-Scale Histograms to Answer Pattern Existence and Shape Match Queries
Similarity-based querying of time series data can be categorized as pattern existence queries and shape match queries. Pattern existence queries find the time series data with ce...
Lei Chen 0002, M. Tamer Özsu, Vincent Oria
91
Voted
IAT
2005
IEEE
15 years 3 months ago
Decomposing Large-Scale POMDP Via Belief State Analysis
Partially observable Markov decision process (POMDP) is commonly used to model a stochastic environment with unobservable states for supporting optimal decision making. Computing ...
Xin Li, William K. Cheung, Jiming Liu
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
15 years 1 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang