Sciweavers

2143 search results - page 159 / 429
» Linking Representation with Meaning
Sort
View
ISCA
2012
IEEE
280views Hardware» more  ISCA 2012»
13 years 9 months ago
A case for random shortcut topologies for HPC interconnects
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
Michihiro Koibuchi, Hiroki Matsutani, Hideharu Ama...
POPL
2005
ACM
16 years 6 months ago
Polymorphic bytecode: compositional compilation for Java-like languages
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
Davide Ancona, Ferruccio Damiani, Sophia Drossopou...
JCDL
2006
ACM
141views Education» more  JCDL 2006»
16 years 14 days ago
An architecture for the aggregation and analysis of scholarly usage data
Although recording of usage data is common in scholarly information services, its exploitation for the creation of valueadded services remains limited due to concerns regarding, a...
Johan Bollen, Herbert Van de Sompel
PVLDB
2010
82views more  PVLDB 2010»
15 years 4 months ago
Record Linkage with Uniqueness Constraints and Erroneous Values
Many data-management applications require integrating data from a variety of sources, where different sources may refer to the same real-world entity in different ways and some ma...
Songtao Guo, Xin Dong, Divesh Srivastava, Remi Zaj...
WSOM
2009
Springer
16 years 1 months ago
Towards Semi-supervised Manifold Learning: UKR with Structural Hints
We explore generic mechanisms to introduce structural hints into the method of Unsupervised Kernel Regression (UKR) in order to learn representations of data sequences in a semi-su...
Jan Steffen, Stefan Klanke, Sethu Vijayakumar, Hel...