130 search results - page 6 / 26 » Algorithms for Finding a Most Similar Subforest |
167
Voted
WSDM
2010
ACM
16 years 27 days ago
2010
ACM
This paper focuses on the problem of identifying influential users of micro-blogging services. Twitter, one of the most notable micro-blogging services, employs a social-networkin...
146
Voted
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
131
Voted
SIGMOD
1997
ACM
15 years 7 months ago
1997
ACM
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
105
Voted
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
Axelrod’s original experiments for evolving IPD player strategies involved the use of a basic GA. In this paper we examine how well a simple GA performs against the more recent P...
127
Voted
AINA
2009
IEEE
15 years 10 months ago
2009
IEEE
The Semantics-based Web Service Matching Model is proposed in this paper to improve the performance of Web Service discovery. Semantics-based Web Service Matching is a two-phase m...