Sciweavers

77 search results - page 3 / 16
» Explicit constructions of RIP matrices and related problems
Sort
View
COMPGEOM
2011
ACM
12 years 11 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
JC
2000
138views more  JC 2000»
13 years 7 months ago
Multivariate Polynomials, Duality, and Structured Matrices
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
Bernard Mourrain, Victor Y. Pan
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
13 years 7 months ago
Constructions of Representations of Rank Two Semisimple Lie Algebras with Distributive Lattices
We associate one or two posets (which we call "semistandard posets") to any given irreducible representation of a rank two semisimple Lie algebra over C. Elsewhere we ha...
L. Wyatt Alverson II, Robert G. Donnelly, Scott J....
ICWSM
2009
13 years 5 months ago
From Episodes to Sagas: Understanding the News by Identifying Temporally Related Story Sequences
Current news interfaces are largely driven by recent information, even though many events are better interpreted in context of previous related events. To address this problem, we...
Ramnath Balasubramanyan, Frank Lin, William W. Coh...
JCT
2011
66views more  JCT 2011»
13 years 2 months ago
Enumeration of non-crossing pairings on bit strings
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
Todd Kemp, Karl Mahlburg, Amarpreet Rattan, Cliffo...