Sciweavers

779 search results - page 71 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
WWW
2006
ACM
14 years 8 months ago
A web-based kernel function for measuring the similarity of short text snippets
Determining the similarity of short text snippets, such as search queries, works poorly with traditional document similarity measures (e.g., cosine), since there are often few, if...
Mehran Sahami, Timothy D. Heilman
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
14 years 7 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
ISBI
2004
IEEE
14 years 8 months ago
Search Space Partitioning Using Convex Hull and Concavity Features for Fast Medical Image Retrieval
A new approach is presented for partitioning an image database by classifying and indexing the convex hull shapes and the number of region concavities. The result is a significant...
Phillip Mlsna, Nikolay Sirakov
HT
2006
ACM
14 years 1 months ago
Implementation and evaluation of a quality-based search engine
In this paper, an approach for the implementation of a qualitybased Web search engine is proposed. Quality retrieval is introduced and an overview on previous efforts to implement...
Thomas Mandl
EDBT
2008
ACM
161views Database» more  EDBT 2008»
14 years 7 months ago
Load distribution of analytical query workloads for database cluster architectures
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
Thomas Phan, Wen-Syan Li