Sciweavers

9719 search results - page 447 / 1944
» Inference for Multiplicative Models
Sort
View
LATIN
2010
Springer
15 years 11 months ago
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
Gero Greiner, Riko Jacob
TABLETOP
2007
IEEE
15 years 11 months ago
Supporting Multiple Off-Axis Viewpoints at a Tabletop Display
A growing body of research is investigating the use of tabletop displays, in particular to support collaborative work. People often interact directly with these displays, typicall...
Mark S. Hancock, M. Sheelagh T. Carpendale
EMSOFT
2007
Springer
15 years 11 months ago
Scheduling multiple independent hard-real-time jobs on a heterogeneous multiprocessor
This paper proposes a scheduling strategy and an automatic scheduling flow that enable the simultaneous execution of multiple hard-real-time dataflow jobs. Each job has its own ...
Orlando Moreira, Frederico Valente, Marco Bekooij
DATE
2006
IEEE
104views Hardware» more  DATE 2006»
15 years 11 months ago
Equivalence verification of arithmetic datapaths with multiple word-length operands
Abstract: This paper addresses the problem of equivalence verification of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have di...
Namrata Shekhar, Priyank Kalla, Florian Enescu
GLOBECOM
2006
IEEE
15 years 11 months ago
Multiple-Hop Routing Based on the Pulse-Position Modulation Header Processing Scheme in All-Optical Ultrafast Packet Switching N
— In this paper we present modeling and simulation of multiple-hop all-optical packet routing based on the pulseposition modulation header processing (PPM-HP) scheme in ultrafast...
Hoa Le Minh, Zabih Ghassemlooy, Wai Pang Ng