Sciweavers

2421 search results - page 164 / 485
» Approximate Flow-Aware Networking
Sort
View
GLOBECOM
2008
IEEE
16 years 27 days ago
Near-Optimum Power Allocation for Outage Restricted Distributed MIMO Multi-Hop Networks
Abstract—The throughput of multi-hop communication systems can significantly be increased by the application of MIMO concepts. To utilize the physical resources in an efficient...
Dirk Wübben, Yidong Lang
COMPGEOM
2005
ACM
15 years 8 months ago
Finding the best shortcut in a geometric network
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmu...
JCO
2006
153views more  JCO 2006»
15 years 6 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong
CGF
1998
134views more  CGF 1998»
15 years 6 months ago
Progressive Iso-Surface Extraction from Hierarchical 3D Meshes
A multiresolution data decomposition offers a fundamental framework supporting compression, progressive transmission, and level-of-detail (LOD) control for large two or three dime...
Wenli Cai, Georgios Sakas, Roberto Grosso, Thomas ...
NECO
2010
136views more  NECO 2010»
15 years 4 months ago
Learning to Represent Spatial Transformations with Factored Higher-Order Boltzmann Machines
To allow the hidden units of a restricted Boltzmann machine to model the transformation between two successive images, Memisevic and Hinton (2007) introduced three-way multiplicat...
Roland Memisevic, Geoffrey E. Hinton