935 search results - page 159 / 187 » Some Results on Orthogonal Factorizations |
84
Voted
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
MOBISYS
2004
ACM
15 years 9 months ago
2004
ACM
In this paper, we investigate the impact of radio irregularity on the communication performance in wireless sensor networks. Radio irregularity is a common phenomenon which arises...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
ICCD
2001
IEEE
15 years 6 months ago
2001
IEEE
Dynamic power is the main source of power consumption in CMOS circuits. It depends on the square of the supply voltage. It may significantly be reduced by scaling down the supply ...
CSCW
2010
ACM
15 years 6 months ago
2010
ACM
In recent years, a growing number of studies examining how culture shapes computer-mediated communication (CMC) have appeared in the CHI and CSCW literature. Findings from these s...