8313 search results - page 1307 / 1663 » Serendipitous Information Retrieval |
195
click to vote
KDD
2000
ACM
15 years 10 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
196
click to vote
ICDCS
1995
IEEE
15 years 10 months ago
1995
IEEE
nt formal speci cations of a new abstraction, weak sets, which can be used to alleviate high latencies when retrieving data from a wide-area information system like the World Wide...
196
click to vote
ICS
2010
Tsinghua U.
15 years 9 months ago
2010
Tsinghua U.
Existing supercomputers have hundreds of thousands of processor cores, and future systems may have hundreds of millions. Developers need detailed performance measurements to tune ...
222
click to vote
FLAIRS
2007
15 years 9 months ago
2007
The basic aim of the model proposed here is to automatically build semantic metatext structure for texts that would allow us to search and extract discourse and semantic informati...
183
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
In plenty of scenarios, data can be represented as vectors mathematically abstracted as points in a Euclidean space. Because a great number of machine learning and data mining app...