2557 search results - page 272 / 512 » Real scaled matching |
130
click to vote
CCS
2009
ACM
16 years 5 months ago
2009
ACM
There is a natural intuitive match between anonymity and information theory. In particular, the maximal anonymity loss in anonymity protocols can be matched to the information the...
128
click to vote
KDD
2002
ACM
16 years 5 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
127
click to vote
CHI
2007
ACM
16 years 5 months ago
2007
ACM
If applications were able to detect a user's expertise, then software could automatically adapt to better match expertise. Detecting expertise is difficult because a user...
129
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
This paper describes our practical query-by-humming system, SoundCompass, which is being used as a karaoke song selection system in Japan. First, we describe the fundamental techn...
166
click to vote
EDBT
2002
ACM
16 years 4 months ago
2002
ACM
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...