Sciweavers

4850 search results - page 281 / 970
» Approximate Data Structures with Applications
Sort
View
CASES
2007
ACM
15 years 8 months ago
Facilitating compiler optimizations through the dynamic mapping of alternate register structures
Aggressive compiler optimizations such as software pipelining and loop invariant code motion can significantly improve application performance, but these transformations often re...
Chris Zimmer, Stephen Roderick Hines, Prasad Kulka...
WWW
2009
ACM
16 years 7 months ago
Triplify: light-weight linked data publication from relational databases
In this paper we present Triplify ? a simplistic but effective approach to publish Linked Data from relational databases. Triplify is based on mapping HTTP-URI requests onto relat...
Sören Auer, Sebastian Dietzold, Jens Lehmann,...
KDD
2010
ACM
188views Data Mining» more  KDD 2010»
15 years 8 months ago
Inferring networks of diffusion and influence
Information diffusion and virus propagation are fundamental processes talking place in networks. While it is often possible to directly observe when nodes become infected, observi...
Manuel Gomez-Rodriguez, Jure Leskovec, Andreas Kra...
COMPGEOM
2011
ACM
14 years 10 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
CVPR
1997
IEEE
16 years 8 months ago
Representation Of Objects In A Volumetric Frequency Domain With Application To Face Recognition
A novel method for representing 3-D objects that unifies viewer and model centered object representations is presented. A unified 3-D frequency-domain representation (called Volum...
Jezekiel Ben-Arie, Dibyendu Nandy