Sciweavers

8540 search results - page 1404 / 1708
» The Dynamic Servers Problem
Sort
View
ICCV
2003
IEEE
16 years 6 months ago
Dominant Sets and Hierarchical Clustering
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
Massimiliano Pavan, Marcello Pelillo
WWW
2007
ACM
16 years 5 months ago
Compare&contrast: using the web to discover comparable cases for news stories
Comparing and contrasting is an important strategy people employ to understand new situations and create solutions for new problems. Similar events can provide hints for problem s...
Jiahui Liu, Earl Wagner, Larry Birnbaum
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 4 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
PODS
2004
ACM
148views Database» more  PODS 2004»
16 years 4 months ago
Deterministic Wavelet Thresholding for Maximum-Error Metrics
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
Minos N. Garofalakis, Amit Kumar
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 4 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
« Prev « First page 1404 / 1708 Last » Next »