Back to Results
First PageMeta Content
Network theory / Graph coloring / Topology / Connectivity / Bridge / Tree / Graph / Flow network / Shortest path problem / Graph theory / Mathematics / Theoretical computer science


Sparse Recovery with Graph Constraints: Fundamental Limits and Measurement Construction Meng Wang Weiyu Xu Enrique Mallada Ao Tang
Add to Reading List

Document Date: 2012-01-15 10:55:28


Open Document

File Size: 232,75 KB

Share Result on Facebook

City

Ithaca / /

Company

R. Calderbank / Cambridge University Press / World Scientific Publishing Company / /

Country

United States / /

Currency

pence / /

Event

Product Issues / /

Facility

Cornell University / /

IndustryTerm

nonnegative solution / line network / all-optical networks / combinatorial / measurement design algorithm / internet topology / obtained reduced network / sensor networks / inner product / Internet tomography / scale-free network / breadth-first search / all-optical mesh networks / line/ring network / communication networks / overlay network / measurement construction algorithm / random networks / sensor network / /

Organization

Cambridge University / National Science Foundation / IMC / Fundamental Limits and Measurement Construction Meng Wang Weiyu Xu Enrique Mallada Ao Tang School of ECE / Cornell University / Pattern Analysis and Machine Intelligence / /

Person

Meng Wang Weiyu Xu Enrique Mallada / Enrique Mallada Ao / Az / /

Position

General / /

Product

members / /

ProvinceOrState

New York / /

PublishedMedium

Lecture Notes in Computer Science / /

RadioStation

Katz / /

Technology

measurement design algorithm / measurement construction algorithm / artificial intelligence / tomography / /

URL

http /

SocialTag