Sciweavers

1002 search results - page 176 / 201
» Towards Graph Programs for Graph Algorithms
Sort
View
DAC
2009
ACM
15 years 6 months ago
A computing origami: folding streams in FPGAs
Stream processing represents an important class of applications that spans telecommunications, multimedia and the Internet. The implementation of streaming programs in FPGAs has a...
Andrei Hagiescu, Weng-Fai Wong, David F. Bacon, Ro...
DAC
1996
ACM
15 years 6 months ago
Using Register-Transfer Paths in Code Generation for Heterogeneous Memory-Register Architectures
In this paper we address the problem of code generation for basic blocks in heterogeneous memory-register DSP processors. We propose a new a technique, based on register-transfer ...
Guido Araujo, Sharad Malik, Mike Tien-Chien Lee
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 5 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
BIS
2008
119views Business» more  BIS 2008»
15 years 3 months ago
Fuzzy Constraint-based Schema Matching Formulation
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
Alsayed Algergawy, Eike Schallehn, Gunter Saake
96
Voted
CORR
2006
Springer
85views Education» more  CORR 2006»
15 years 1 months ago
Discovering Network Topology in the Presence of Byzantine Faults
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Mikhail Nesterenko, Sébastien Tixeuil