Sciweavers

4112 search results - page 169 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
CVPR
2008
IEEE
16 years 6 months ago
Reduce, reuse & recycle: Efficiently solving multi-label MRFs
In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRFs o...
Karteek Alahari, Pushmeet Kohli, Philip H. S. Torr
SAC
2006
ACM
15 years 4 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
ICDE
2006
IEEE
165views Database» more  ICDE 2006»
16 years 6 months ago
Efficient Continuous Skyline Computation
In a number of emerging streaming applications, the data values that are produced have an associated time interval for which they are valid. A useful computation over such streami...
Michael D. Morse, Jignesh M. Patel, William I. Gro...
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
16 years 5 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
DIS
2007
Springer
15 years 8 months ago
Efficient Incremental Mining of Top-K Frequent Closed Itemsets
In this work we study the mining of top-K frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support thresh...
Andrea Pietracaprina, Fabio Vandin