Sciweavers

4325 search results - page 643 / 865
» Incremental computation with names
Sort
View
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
15 years 5 months ago
Hardness Results for Homology Localization
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
Chao Chen, Daniel Freedman
TCS
2010
15 years 5 months ago
Strong normalization property for second order linear logic
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
Michele Pagani, Lorenzo Tortora de Falco
WALCOM
2010
IEEE
260views Algorithms» more  WALCOM 2010»
15 years 4 months ago
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
WCNC
2010
IEEE
15 years 4 months ago
Switch-And-Stay Transmit Diversity for Cooperative Decode-And-Forward Systems
—We consider the application of switch-and-stay transmit diversity (SSTD) to a three-node cooperative diversity system with decode-and-forward relaying. The basic idea of SSTD ge...
Andreas Müller, Joachim Speidel
WIOPT
2010
IEEE
15 years 4 months ago
Low complexity algorithms for relay selection and power control in interference-limited environments
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...
Lazaros Gkatzikis, Iordanis Koutsopoulos