Sciweavers

15 search results - page 2 / 3
» Eliminating graphs by means of parallel knock-out schemes
Sort
View
IEEEPACT
2002
IEEE
14 years 19 days ago
Exploiting Pseudo-Schedules to Guide Data Dependence Graph Partitioning
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
Alex Aletà, Josep M. Codina, F. Jesú...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 7 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
IPPS
2002
IEEE
14 years 19 days ago
Dominating Set Based Bluetooth Scatternet Formation with Localized Maintenance
This paper addresses the problem of scatternet formation and maintenance for multi-hop Bluetooth based personal area and ad hoc networks with minimal communication overhead. Each ...
Ivan Stojmenovic
ICDCS
2010
IEEE
13 years 9 months ago
Opportunistic Routing for Interactive Traffic in Wireless Networks
Abstract--To take advantage of the broadcast nature of wireless communication, a number of opportunistic routing techniques have recently been proposed. In order to manage the extr...
Tianji Li, Douglas J. Leith, Lili Qiu
TCSV
2002
148views more  TCSV 2002»
13 years 7 months ago
A full-featured, error-resilient, scalable wavelet video codec based on the set partitioning in hierarchical trees (SPIHT) algor
Compressed video bitstreams require protection from channel errors in a wireless channel. The threedimensional (3-D) SPIHT coder has proved its efficiency and its real-time capabi...
Sungdae Cho, William A. Pearlman