Sciweavers

4171 search results - page 595 / 835
» Choice numbers of graphs
Sort
View
AAAI
2011
14 years 6 months ago
Exploiting Phase Transition in Latent Networks for Clustering
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
Vahed Qazvinian, Dragomir R. Radev
ESA
2011
Springer
249views Algorithms» more  ESA 2011»
14 years 6 months ago
Improved Algorithms for Partial Curve Matching
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
Anil Maheshwari, Jörg-Rüdiger Sack, Kave...
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...
DAC
2003
ACM
16 years 7 months ago
Embedded intelligent SRAM
Many embedded systems use a simple pipelined RISC processor for computation and an on-chip SRAM for data storage. We present an enhancement called Intelligent SRAM (ISRAM) that co...
Prabhat Jain, G. Edward Suh, Srinivas Devadas
DCC
2006
IEEE
16 years 6 months ago
Joint Source-Channel Decoding of Multiple Description Quantized Markov Sequences
This paper proposes a framework for joint source-channel decoding of Markov sequences that are coded by a fixed-rate multiple description quantizer (MDQ), and transmitted via a lo...
Xiaolin Wu, Xiaohan Wang