1982 search results - page 141 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
116
click to vote
WWW
2004
ACM
16 years 4 months ago
2004
ACM
The massive distribution of the crawling task can lead to inefficient exploration of the same portion of the Web. We propose a technique to guide crawlers exploration based on the...
130
click to vote
TVLSI
2008
15 years 3 months ago
2008
To satisfy the advanced forward-error-correction (FEC) standards, in which the Convolutional code and Turbo code may co-exit, a prototype design of a unified Convolutional/Turbo de...
139
click to vote
SSPR
1998
Springer
15 years 8 months ago
1998
Springer
: We present a practical approach to nonparametric cluster analysis of large data sets. The number of clusters and the cluster centres are automatically derived by mode seeking wit...
138
click to vote
KDD
1999
ACM
15 years 8 months ago
1999
ACM
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly from...
120
click to vote
ENTCS
2008
15 years 4 months ago
2008
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...