Sciweavers

1887 search results - page 194 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
16 years 3 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
RTCSA
1998
IEEE
15 years 7 months ago
Wait-Free Snapshots in Real-Time Systems: Algorithms and Performance
Snap-shot mechanisms are used to read a globally consistent set of variable values. Such a mechanism can be used to solve a variety of communication and synchronization problems, ...
Andreas Ermedahl, Hans Hansson, Marina Papatrianta...
CORR
2011
Springer
197views Education» more  CORR 2011»
14 years 10 months ago
Query Expansion Based on Clustered Results
Query expansion is a functionality of search engines that suggests a set of related queries for a user-issued keyword query. Typical corpus-driven keyword query expansion approach...
Ziyang Liu, Sivaramakrishnan Natarajan, Yi Chen
DATE
2007
IEEE
127views Hardware» more  DATE 2007»
15 years 9 months ago
A calculator for Pareto points
This paper presents the Pareto Calculator, a tool for compositional computation of Pareto points, based on the algebra of Pareto points. The tool is a useful instrument for multidi...
Marc Geilen, Twan Basten
CIKM
2009
Springer
15 years 9 months ago
Using domain ontology for semantic web usage mining and next page prediction
This paper proposes the integration of semantic information drawn from a web application’s domain knowledge into all phases of the web usage mining process (preprocessing, patte...
Nizar R. Mabroukeh, Christie I. Ezeife