Sciweavers

779 search results - page 74 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
CIKM
2010
Springer
15 years 4 months ago
Probabilistic ranking for relational databases based on correlations
This paper proposes a ranking method to exploit statistical correlations among pairs of attribute values in relational databases. For a given query, the correlations of the query ...
Jaehui Park, Sang-goo Lee
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 10 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
CIKM
2007
Springer
16 years 11 days ago
Nugget discovery in visual exploration environments by query consolidation
Queries issued by casual users or specialists exploring a data set often point us to important subsets of the data, be it clusters, outliers or other features of particular import...
Di Yang, Elke A. Rundensteiner, Matthew O. Ward
WSDM
2009
ACM
158views Data Mining» more  WSDM 2009»
16 years 1 months ago
A new visual search interface for web browsing
We introduce a new visual search interface for search engines. The interface is a user-friendly and informative graphical front-end for organizing and presenting search results in...
Songhua Xu, Tao Jin, Francis Chi-Moon Lau
CG
2004
Springer
15 years 10 months ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li