960 search results - page 62 / 192 » CURE: An Efficient Clustering Algorithm for Large Databases |
121
click to vote
DAC
2001
ACM
16 years 4 months ago
2001
ACM
Clustering is an effective method to increase the available parallelism in VLIW datapaths without incurring severe penalties associated with large number of register file ports. E...
219
click to vote
ICDE
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper, we introduce the concept of a QA-Pagelet to refer to the content region in a dynamic page that contains query matches. We present THOR, a scalable and efficient min...
129
click to vote
ADC
2003
Springer
15 years 9 months ago
2003
Springer
The rapid increase of web complexity and size makes web searched results far from satisfaction in many cases due to a huge amount of information returned by search engines. How to...
172
click to vote
KDD
2012
ACM
13 years 6 months ago
2012
ACM
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
160
click to vote
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...