Sciweavers

123 search results - page 16 / 25
» Similarity Search and Mining in Uncertain Databases
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 9 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
DEXA
2006
Springer
197views Database» more  DEXA 2006»
13 years 8 months ago
Cleaning Web Pages for Effective Web Content Mining
Classifying and mining noise-free web pages will improve on accuracy of search results as well as search speed, and may benefit webpage organization applications (e.g., keyword-bas...
Jing Li, Christie I. Ezeife
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
14 years 8 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong
MM
2006
ACM
167views Multimedia» more  MM 2006»
14 years 20 days ago
Image annotation by large-scale content-based image retrieval
Image annotation has been an active research topic in recent years due to its potentially large impact on both image understanding and Web image search. In this paper, we target a...
Xirong Li, Le Chen, Lei Zhang, Fuzong Lin, Wei-Yin...
ITICSE
2004
ACM
14 years 4 days ago
Use of large databases for group projects at the nexus of teaching and research
Final year, group (capstone) projects in computing disciplines are often expected to fill multiple roles: in addition to allowing students to learn important domain-specific knowl...
Richard C. Thomas, Rebecca Mancy