Sciweavers

693 search results - page 76 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
DOCENG
2006
ACM
14 years 2 months ago
Fast and simple XML tree differencing by sequence alignment
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
Tancred Lindholm, Jaakko Kangasharju, Sasu Tarkoma
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
14 years 8 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
RECSYS
2009
ACM
14 years 2 months ago
Recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Aditya G. Parameswaran, Hector Garcia-Molina
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
14 years 25 days ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak
EDBT
2009
ACM
122views Database» more  EDBT 2009»
13 years 12 months ago
Finding the influence set through skylines
Given a set P of products, a set O of customers, and a product p P, a bichromatic reverse skyline query retrieves all the customers in O that do not find any other product in P t...
Xiaobing Wu, Yufei Tao, Raymond Chi-Wing Wong, Lin...