Sciweavers

70 search results - page 4 / 14
» An Exact Characterization of Greedy Structures
Sort
View
88
Voted
CORR
2011
Springer
214views Education» more  CORR 2011»
14 years 1 months ago
Convex Approaches to Model Wavelet Sparsity Patterns
Statistical dependencies among wavelet coefficients are commonly represented by graphical models such as hidden Markov trees (HMTs). However, in linear inverse problems such as d...
Nikhil S. Rao, Robert D. Nowak, Stephen J. Wright,...
KDD
2007
ACM
155views Data Mining» more  KDD 2007»
15 years 9 months ago
A framework for community identification in dynamic social networks
We propose frameworks and algorithms for identifying communities in social networks that change over time. Communities are intuitively characterized as "unusually densely kni...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf, D...
100
Voted
LFCS
2009
Springer
15 years 4 months ago
Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination
Canonical propositional Gentzen-type calculi are a natural class of systems which in addition to the standard axioms and structural rules have only logical rules where exactly one ...
Arnon Avron, Anna Zamansky
JSAC
2008
76views more  JSAC 2008»
14 years 9 months ago
Rate-Based Equilibria in Collision Channels with Fading
We consider a wireless collision channel, shared by a finite number of users who transmit to a common base station. Each user wishes to minimize its average transmission rate (or p...
Ishai Menache, Nahum Shimkin
DM
2006
83views more  DM 2006»
14 years 9 months ago
Language structure of pattern Sturmian words
Pattern Sturmian words introduced by Kamae and Zamboni KZ1, KZ2] are an analogy of Sturmian words for the maximal pattern complexity instead of the block complexity. So far, two k...
Teturo Kamae, Hui Rao, Bo Tan, Yu-Mei Xue