Sciweavers

3708 search results - page 405 / 742
» Approximating Betweenness Centrality
Sort
View
ICASSP
2009
IEEE
16 years 1 months ago
Cross-layer optimization of wireless fading ad-hoc networks
This paper introduces an algorithm to approximately find optimal wireless networks in presence of fading. Joint optimization of application level rates, routes, link capacities, ...
Nikolaos Gatsis, Alejandro Ribeiro, Georgios B. Gi...
ICC
2009
IEEE
130views Communications» more  ICC 2009»
16 years 1 months ago
Repeater-Assisted Capacity Enhancement (RACE) for MIMO Links in a Line-of-Sight Environment
— A single on-frequency, full duplex wireless repeater is considered for enhancing the capacity of a long-distance 2x2 multiple-input multiple-output (MIMO) wireless link with a ...
Brett T. Walkenhorst, Mary Ann Ingram
WIAMIS
2009
IEEE
16 years 1 months ago
3D shape from multi-camera views by error projection minimization
Traditional shape from silhouette methods compute the 3D shape as the intersection of the back-projected silhouettes in the 3D space, the so called visual hull. However, silhouett...
Gloria Haro, Montse Pardàs
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
16 years 1 months ago
Integer Polyhedra for Program Analysis
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
Philip J. Charles, Jacob M. Howe, Andy King
APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
16 years 1 months ago
Random Tensors and Planted Cliques
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
S. Charles Brubaker, Santosh Vempala