Sciweavers

2520 search results - page 299 / 504
» The complexity of approximating entropy
Sort
View
MA
2010
Springer
132views Communications» more  MA 2010»
15 years 5 months ago
Model selection by sequentially normalized least squares
Model selection by the predictive least squares (PLS) principle has been thoroughly studied in the context of regression model selection and autoregressive (AR) model order estima...
Jorma Rissanen, Teemu Roos, Petri Myllymäki
MOBIHOC
2010
ACM
15 years 4 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
CORR
2011
Springer
169views Education» more  CORR 2011»
15 years 1 months ago
Power Allocation Based on SEP Minimization in Two-Hop Decode-and-Forward Relay Networks
—The problem of optimal power allocation among the relays in a two-hop decode-and-forward cooperative relay network with independent Rayleigh fading channels is considered. It is...
Arash Khabbazibasmenj, Sergiy A. Vorobyov
CORR
2010
Springer
81views Education» more  CORR 2010»
15 years 1 months ago
Analysis of Agglomerative Clustering
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
Marcel R. Ackermann, Johannes Blömer, Daniel ...
SIAMNUM
2010
178views more  SIAMNUM 2010»
15 years 1 months ago
A New Class of High Order Finite Volume Methods for Second Order Elliptic Equations
In the numerical simulation of many practical problems in physics and engineering, finite volume methods are an important and popular class of discretization methods due to the loc...
Long Chen