5595 search results - page 734 / 1119 » Approximation Algorithms for Clustering Problems |
198
click to vote
CIKM
2004
Springer
16 years 6 days ago
2004
Springer
It is crucial in many information systems to organize short text segments, such as keywords in documents and queries from users, into a well-formed topic hierarchy. In this paper,...
177
click to vote
EDBT
2008
ACM
16 years 7 months ago
2008
ACM
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
193
Voted
STOC
1997
ACM
15 years 11 months ago
1997
ACM
We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We con...
187
click to vote
KDD
2004
ACM
16 years 5 days ago
2004
ACM
In this paper, we propose a novel data mining technique for the efficient damage detection within the large-scale complex mechanical structures. Every mechanical structure is defi...
162
click to vote
TON
2008
15 years 6 months ago
2008
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 ...