Sciweavers

1492 search results - page 89 / 299
» Testing Properties of Constraint-Graphs
Sort
View
150
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Itakura-Saito nonnegative matrix factorization with group sparsity
We propose an unsupervised inference procedure for audio source separation. Components in nonnegative matrix factorization (NMF) are grouped automatically in audio sources via a p...
Augustin Lefevre, Francis Bach, Cédric F&ea...
SIAMCOMP
2011
14 years 6 months ago
An Expansion Tester for Bounded Degree Graphs
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
Satyen Kale, C. Seshadhri
203
Voted
APPROX
2011
Springer
284views Algorithms» more  APPROX 2011»
14 years 3 months ago
On Approximating the Number of Relevant Variables in a Function
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
Dana Ron, Gilad Tsur
105
Voted
ICCCN
2007
IEEE
15 years 10 months ago
Localized detection of k-connectivity in wireless ad hoc, actuator and sensor networks
- Ad hoc, actuator and sensor wireless networks normally have critical connectivity properties before becoming fault intolerant. Existing algorithms for testing k-connectivity are ...
Milenko Jorgic, Nishith Goel, Kalai Kalaichelvan, ...
136
Voted
GI
2009
Springer
15 years 8 months ago
Tapir: Language Support to Reduce the State Space in Model-Checking
: Model-checking is a way of testing the correctness of concurrent programs. To do so, a model of the program is proven to match properties and constraints specified by the progra...
Ronald Veldema, Michael Philippsen