Sciweavers

176 search results - page 12 / 36
» Reducing the number of counters needed for integer multiplic...
Sort
View
CPM
2010
Springer
180views Combinatorics» more  CPM 2010»
14 years 10 days ago
Algorithms for Three Versions of the Shortest Common Superstring Problem
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...
INFOCOM
2008
IEEE
14 years 1 months ago
All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching
—All-Optical Label Swapping (AOLS) forms a key technology towards the implementation of All-Optical Packet Switching nodes (AOPS) for the future optical Internet. The capital exp...
Fernando Solano, Ruth van Caenegem, Didier Colle, ...
GLOBECOM
2008
IEEE
14 years 2 months ago
Network Resource Allocation for Competing Multiple Description Transmissions
Providing real-time multimedia services over a best-effort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple des...
Ying Li, Chao Tian, Suhas N. Diggavi, Mung Chiang,...
VISUALIZATION
1996
IEEE
13 years 11 months ago
Hierarchical and Parallelizable Direct Volume Rendering for Irregular and Multiple Grids
A general volume rendering technique is described that efficiently produces images of excellent quality from data defined over irregular grids having a wide variety of formats. Re...
Jane Wilhelms, Allen Van Gelder, Paul Tarantino, J...
GLOBECOM
2007
IEEE
14 years 1 months ago
Degrees of Freedom of the MIMO X Channel
— We provide achievability as well as converse results for the degrees of freedom region of a MIMO X channel, i.e., a system with two transmitters, two receivers, each equipped w...
Syed Ali Jafar, Shlomo Shamai