Sciweavers

147 search results - page 17 / 30
» Very sparse random projections
Sort
View
SPAA
2009
ACM
14 years 8 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman
DCG
2006
110views more  DCG 2006»
13 years 7 months ago
High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...
David L. Donoho
ICIP
2010
IEEE
13 years 5 months ago
Compressed sensing for aperture synthesis imaging
The theory of compressed sensing has a natural application in interferometric aperture synthesis. As in many real-world applications, however, the assumption of random sampling, w...
Stephan Wenger, Soheil Darabi, Pradeep Sen, Karl-H...
ICASSP
2009
IEEE
14 years 2 months ago
Joint reconstruction of compressed multi-view images
This paper proposes a distributed representation algorithm for multi-view images that are jointly reconstructed at the decoder. Compressed versions of each image are first obtain...
Xu Chen, Pascal Frossard
ACSC
2009
IEEE
14 years 2 months ago
Using Chronological Splitting to Compare Cross- and Single-company Effort Models: Further Investigation
Numerous studies have used historical datasets to build and validate models for estimating software development effort. Very few used a chronological split (where projects’ end ...
Chris Lokan, Emilia Mendes