Sciweavers

8294 search results - page 965 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
CVPR
2012
IEEE
13 years 10 months ago
Incremental gradient on the Grassmannian for online foreground and background separation in subsampled video
It has recently been shown that only a small number of samples from a low-rank matrix are necessary to reconstruct the entire matrix. We bring this to bear on computer vision prob...
Jun He, Laura Balzano, Arthur Szlam
DAC
2003
ACM
16 years 8 months ago
Symbolic representation with ordered function templates
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...
Amit Goel, Gagan Hasteer, Randal E. Bryant
ISCC
2002
IEEE
147views Communications» more  ISCC 2002»
16 years 13 days ago
A new method for finding generalized frequent itemsets in generalized association rule mining
Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules, given a taxonomy. In this paper, we describe a forma...
Kritsada Sriphaew, Thanaruk Theeramunkong
SIGIR
2008
ACM
15 years 7 months ago
To tag or not to tag -: harvesting adjacent metadata in large-scale tagging systems
We present HAMLET, a suite of principles, scoring models and algorithms to automatically propagate metadata along edges in a document neighborhood. As a showcase scenario we consi...
Adriana Budura, Sebastian Michel, Philippe Cudr&ea...
ACIVS
2010
Springer
15 years 5 months ago
Exploiting Neighbors for Faster Scanning Window Detection in Images
Detection of objects through scanning windows is widely used and accepted method. The detectors traditionally do not make use of information that is shared between neighboring imag...
Pavel Zemcík, Michal Hradis, Adam Herout