Sciweavers

826 search results - page 124 / 166
» Designing for families
Sort
View
HPDC
2002
IEEE
15 years 2 months ago
Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications
In high energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So...
Kavitha Ranganathan, Ian T. Foster
ICALP
2010
Springer
15 years 2 months ago
Dynamic Programming for Graphs on Surfaces
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
Juanjo Rué, Ignasi Sau, Dimitrios M. Thilik...
DATE
2000
IEEE
108views Hardware» more  DATE 2000»
15 years 2 months ago
A 50 Mbit/s Iterative Turbo-Decoder
Very low bit error rate has become an important constraint in high performance communication systems that operate at very low signal to noise ratios: due to their impressive codin...
F. Viglione, Guido Masera, Gianluca Piccinini, Mas...
ECCV
2000
Springer
15 years 2 months ago
Approximate N-View Stereo
This paper introduces a new multi-view reconstruction problem called approximate N -view stereo. The goal of this problem is to recover a oneparameter family of volumes that are in...
Kiriakos N. Kutulakos
IPPS
1998
IEEE
15 years 2 months ago
Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
Wei Shi, Pradip K. Srimani