Sciweavers

583 search results - page 24 / 117
» Computing Linking Numbers of a Filtration
Sort
View
SCIA
2011
Springer
223views Image Analysis» more  SCIA 2011»
13 years 20 days ago
Stable Structure from Motion for Unordered Image Collections
We present a non-incremental approach to structure from motion. Our solution is based on robustly computing global rotations from relative geometries and feeding these into the kno...
Carl Olsson, Olof Enqvist
COMCOM
2004
85views more  COMCOM 2004»
13 years 9 months ago
Optimal PNNI complex node representations for restrictive costs
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...
Ilias Iliadis
BROADNETS
2005
IEEE
14 years 3 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
TIT
2010
102views Education» more  TIT 2010»
13 years 4 months ago
On instantaneous relaying
Abstract--The Gaussian, three-node relay channel with orthogonal receive components (i.e., the transmitted signals from the source and the relay do not interfere with each other) i...
Majid Nasiri Khormuji, Mikael Skoglund
ISCA
2012
IEEE
280views Hardware» more  ISCA 2012»
12 years 8 days ago
A case for random shortcut topologies for HPC interconnects
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
Michihiro Koibuchi, Hiroki Matsutani, Hideharu Ama...