Sciweavers

552 search results - page 73 / 111
» Efficient Algorithms for Processing XPath Queries
Sort
View
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 6 days ago
SPIRAL: efficient and exact model identification for hidden Markov models
Hidden Markov models (HMMs) have received considerable attention in various communities (e.g, speech recognition, neurology and bioinformatic) since many applications that use HMM...
Yasuhiro Fujiwara, Yasushi Sakurai, Masashi Yamamu...
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
16 years 1 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi
WWW
2004
ACM
16 years 14 days ago
Affinity rank: a new scheme for efficient web search
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative...
Yi Liu, Benyu Zhang, Zheng Chen, Michael R. Lyu, W...
PODS
2005
ACM
131views Database» more  PODS 2005»
15 years 12 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
CIKM
2011
Springer
13 years 11 months ago
An efficient method for using machine translation technologies in cross-language patent search
Topics in prior-art patent search are typically full patent applications and relevant items are patents often taken from sources in different languages. Cross language patent retr...
Walid Magdy, Gareth J. F. Jones