Sciweavers

4171 search results - page 257 / 835
» Choice numbers of graphs
Sort
View
CORR
2007
Springer
87views Education» more  CORR 2007»
15 years 6 months ago
Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency
Abstract—The problem of hypothesis testing against independence for a Gauss–Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the...
Animashree Anandkumar, Lang Tong, Ananthram Swami
ML
2008
ACM
146views Machine Learning» more  ML 2008»
15 years 6 months ago
Improving maximum margin matrix factorization
Abstract. Collaborative filtering is a popular method for personalizing product recommendations. Maximum Margin Matrix Factorization (MMMF) has been proposed as one successful lear...
Markus Weimer, Alexandros Karatzoglou, Alex J. Smo...
PC
2000
93views Management» more  PC 2000»
15 years 6 months ago
Scheduling outtrees of height one in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
Jacques Verriet
ICASSP
2010
IEEE
15 years 5 months ago
Unidirectional graph-based wavelet transforms for efficient data gathering in sensor networks
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
Sunil K. Narang, Godwin Shen, Antonio Ortega
RSP
2000
IEEE
156views Control Systems» more  RSP 2000»
15 years 11 months ago
Quasi-Static Scheduling of Reconfigurable Dataflow Graphs for DSP Systems
Dataflow programming has proven to be popular for representing applications in rapid prototyping tools for digital signal processing (DSP); however, existing dataflow design tools...
Bishnupriya Bhattacharya, Shuvra S. Bhattacharyya