Sciweavers

5100 search results - page 831 / 1020
» The Linear Complexity of a Graph
Sort
View
TCS
2010
15 years 1 months ago
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
Samuel Alexandre Vidal
TOC
2010
147views Management» more  TOC 2010»
15 years 1 months ago
Quantum Expanders: Motivation and Construction
: We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma
TON
2010
126views more  TON 2010»
15 years 1 months ago
MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
ICASSP
2011
IEEE
14 years 10 months ago
Scalable robust hypothesis tests using graphical models
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
Divyanshu Vats, Vishal Monga, Umamahesh Srinivas, ...
ICASSP
2011
IEEE
14 years 10 months ago
Contour-based hidden Markov model to segment 2D ultrasound images
The segmentation of ultrasound images is challenging due to the difficulty of appropriate modeling of their appearance variations including speckle as well as signal dropout. We ...
Xiaoning Qian, Byung-Jun Yoon