Sciweavers

1429 search results - page 212 / 286
» Efficient processing of XPath queries using indexes
Sort
View
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
14 years 9 months 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...
DAGM
2010
Springer
13 years 9 months ago
An Improved Histogram of Edge Local Orientations for Sketch-Based Image Retrieval
Content-based image retrieval requires a natural image (e.g, a photo) as query, but the absence of such a query image is usually the reason for a search. An easy way to express the...
Jose M. Saavedra, Benjamin Bustos
ADCS
2004
13 years 10 months ago
On the Effectiveness of Relevance Profiling
Relevance profiling is a general process for withindocument retrieval. Given a query, a profile of retrieval status values is computed by sliding a fixed sized window across a doc...
David J. Harper, David Lee
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
14 years 9 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
ICDE
2001
IEEE
201views Database» more  ICDE 2001»
14 years 10 months ago
Approximate Nearest Neighbor Searching in Multimedia Databases
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...