1568 search results - page 212 / 314 » The problem of examination questions in algorithmics |
170
click to vote
INFOCOM
2011
IEEE
14 years 9 months ago
2011
IEEE
—We consider the question of how a conspiring subgroup of peers in a p2p network can find each other and communicate without provoking suspicion among regular peers or an author...
191
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
Characterising the differences between two databases is an often occurring problem in Data Mining. Detection of change over time is a prime example, comparing databases from two b...
154
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
K-means is a widely used partitional clustering method. While there are considerable research efforts to characterize the key features of K-means clustering, further investigation...
163
click to vote
WSDM
2010
ACM
16 years 3 months ago
2010
ACM
Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a ...
148
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...