540 search results - page 93 / 108 » Efficient Similarity Search for Hierarchical Data in Large D... |
174
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
BMCBI
2010
14 years 4 months ago
2010
Background: Profile HMMs (hidden Markov models) provide effective methods for modeling the conserved regions of protein families. A limitation of the resulting domain models is th...
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
72
Voted
SIGMOD
2004
ACM
15 years 9 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...
KDD
2002
ACM
15 years 10 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...