Sciweavers

4037 search results - page 36 / 808
» Routing without ordering
Sort
View
CONCUR
2007
Springer
14 years 1 months ago
Asynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
Paul-André Melliès, Samuel Mimram
CIKM
2006
Springer
13 years 11 months ago
SaLSa: computing the skyline without scanning the whole sky
Skyline queries compute the set of Pareto-optimal tuples in a relation, i.e., those tuples that are not dominated by any other tuple in the same relation. Although several algorit...
Ilaria Bartolini, Paolo Ciaccia, Marco Patella
BILDMED
2007
107views Algorithms» more  BILDMED 2007»
13 years 9 months ago
Interactive Guidance System for C-Arm Repositioning Without Radiation
Abstract. The problem of repositioning mobile C-arms to defined target locations during surgical procedures currently requires not only time, but also skill and additional radiati...
Tassilo Klein, Selim Benhimane, Jörg Traub, S...
TCOM
2010
61views more  TCOM 2010»
13 years 6 months ago
Variable-rate M-PSK communications without channel amplitude estimation
—Channel estimation at the receiver side is essential to adaptive modulation schemes, prohibiting low complexity systems from using variable rate and/or variable power transmissi...
Athanasios S. Lioumpas, George K. Karagiannidis
DAC
2007
ACM
13 years 11 months ago
SBPOR: Second-Order Balanced Truncation for Passive Order Reduction of RLC Circuits
RLC circuits have been shown to be better formulated as second-order systems instead of first-order systems. The corresponding model order reduction techniques for secondorder sys...
Boyuan Yan, Sheldon X.-D. Tan, Pu Liu, Bruce McGau...