Sciweavers

882 search results - page 71 / 177
» On self-embeddings of computable linear orderings
Sort
View
DEXA
2010
Springer
182views Database» more  DEXA 2010»
14 years 10 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
SIMULATION
1998
177views more  SIMULATION 1998»
14 years 9 months ago
Simulation and Planning of an Intermodal Container Terminal
A decision support system for the management of an intermodal container terminal is presented. Among the problems to be solved, there are the spatial allocation of containers on t...
Luca Maria Gambardella, Andrea Emilio Rizzoli, Mar...
VLSISP
2002
103views more  VLSISP 2002»
14 years 9 months ago
A New Class of Efficient Block-Iterative Interference Cancellation Techniques for Digital Communication Receivers
A new and efficient class of nonlinear receivers is introduced for digital communication systems. These "iterated-decision" receivers use optimized multipass algorithms t...
Albert M. Chan, Gregory W. Wornell
GD
2001
Springer
15 years 2 months ago
Fast and Simple Horizontal Coordinate Assignment
Abstract. We present a simple, linear-time algorithm to determine horizontal coordinates in layered layouts subject to a given ordering within each layer. The algorithm is easy to ...
Ulrik Brandes, Boris Köpf
ICDCS
1997
IEEE
15 years 2 months ago
Secure Reliable Multicast Protocols in a WAN
A secure reliable multicast protocol enables a process to send a message to a group of recipients such that all correct destinations receive the same message, despite the maliciou...
Dahlia Malkhi, Michael Merritt, Ohad Rodeh