13026 search results - page 2223 / 2606 » Probabilistic Relational Models |
263
click to vote
ASPLOS
2009
ACM
16 years 5 months ago
2009
ACM
Parallel bit stream algorithms exploit the SWAR (SIMD within a register) capabilities of commodity processors in high-performance text processing applications such as UTF8 to UTF-...
141
Voted
KDD
2008
ACM
16 years 5 months ago
2008
ACM
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
146
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
149
click to vote
KDD
2005
ACM
16 years 5 months ago
2005
ACM
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
130
click to vote
KDD
2002
ACM
16 years 5 months ago
2002
ACM
The problem of measuring "similarity" of objects arises in many applications, and many domain-specific measures have been developed, e.g., matching text across documents...