Sciweavers

2479 search results - page 375 / 496
» A Computational Theory of Working Memory
Sort
View
DAC
2006
ACM
16 years 7 months ago
DAG-aware AIG rewriting a fresh look at combinational logic synthesis
This paper presents a technique for preprocessing combinational logic before technology mapping. The technique is based on the representation of combinational logic using And-Inve...
Alan Mishchenko, Satrajit Chatterjee, Robert K. Br...
WWW
2009
ACM
16 years 6 months ago
Mapping the world's photos
We investigate how to organize a large collection of geotagged photos, working with a dataset of about 35 million images collected from Flickr. Our approach combines content analy...
David J. Crandall, Lars Backstrom, Daniel P. Hutte...
WWW
2008
ACM
16 years 6 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 6 months ago
Weighted graphs and disconnected components: patterns and a generator
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
Mary McGlohon, Leman Akoglu, Christos Faloutsos
151
Voted
SDM
2009
SIAM
112views Data Mining» more  SDM 2009»
16 years 3 months ago
A Re-evaluation of the Over-Searching Phenomenon in Inductive Rule Learning.
Most commonly used inductive rule learning algorithms employ a hill-climbing search, whereas local pattern discovery algorithms employ exhaustive search. In this paper, we evaluat...
Frederik Janssen, Johannes Fürnkranz