Sciweavers

1986 search results - page 234 / 398
» Path Separability of Graphs
Sort
View
130
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Joint source-channel-network coding for bidirectional wireless relays
The application of joint source-channel coding, based on fountain codes, in the broadcast timeslot of wireless two-way network coding is investigated in this paper. A computationa...
Francois P. S. Luus, Bodhaswar T. Maharaj
173
Voted
EDBT
2011
ACM
254views Database» more  EDBT 2011»
14 years 6 months ago
SocialSearch: enhancing entity search with social network matching
This paper introduces the problem of matching people names to their corresponding social network identities such as their Twitter accounts. Existing tools for this purpose build u...
Gae-won You, Seung-won Hwang, Zaiqing Nie, Ji-Rong...
82
Voted
ICCD
2000
IEEE
103views Hardware» more  ICCD 2000»
15 years 11 months ago
Efficient Place and Route for Pipeline Reconfigurable Architectures
In this paper, we present a fast and eficient compilation methodology for pipeline reconfigurable architectures. Our compiler back-end is much faster than conventional CAD tools, ...
Srihari Cadambi, Seth Copen Goldstein
120
Voted
SEFM
2008
IEEE
15 years 9 months ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...
110
Voted
ICMCS
2007
IEEE
125views Multimedia» more  ICMCS 2007»
15 years 9 months ago
A Framework for Provisioning Overlay Network Based Multimedia Distribution Services
In this paper, we present a graph-theoretic framework for provisioning overlay network based multimedia distribution services to a diverse set of receivers. Considering resource l...
Dewan Tanvir Ahmed, Shervin Shirmohammadi