Sciweavers

1887 search results - page 28 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
ICDM
2003
IEEE
104views Data Mining» more  ICDM 2003»
14 years 29 days ago
Structure Search and Stability Enhancement of Bayesian Networks
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...
Hanchuan Peng, Chris H. Q. Ding
CIKM
2008
Springer
13 years 9 months ago
Efficient and effective link analysis with precomputed salsa maps
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
Marc Najork, Nick Craswell
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 9 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han
ICALP
1998
Springer
13 years 12 months ago
Efficient Approximation Algorithms for the Subset-Sums Equality Problem
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...
Cristina Bazgan, Miklos Santha, Zsolt Tuza
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
13 years 11 months ago
Finding Mobile Data: Efficiency vs. Location Inaccuracy
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
Amotz Bar-Noy, Joanna Klukowska