Sciweavers

901 search results - page 35 / 181
» Analyzing linear mergers
Sort
View
JMLR
2010
115views more  JMLR 2010»
14 years 9 months ago
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwr...
JSAC
2010
131views more  JSAC 2010»
14 years 9 months ago
Joint synchronization and localization using TOAs: A linearization based WLS solution
—Joint synchronization and localization using time of arrival (TOA) measurements is a very important research topic for many wireless ad hoc sensor network applications. For such...
Shouhong Zhu, Zhiguo Ding
ASPDAC
2010
ACM
211views Hardware» more  ASPDAC 2010»
14 years 9 months ago
A fast analog mismatch analysis by an incremental and stochastic trajectory piecewise linear macromodel
To cope with an increasing complexity when analyzing analog mismatch in sub-90nm designs, this paper presents a fast non-MonteCarlo method to calculate mismatch in time domain. Th...
Hao Yu, Xuexin Liu, Hai Wang, Sheldon X.-D. Tan
GLOBECOM
2010
IEEE
14 years 9 months ago
Throughput and Energy Efficiency of Opportunistic Routing with Type-I HARQ in Linear Multihop Networks
Opportunistic routing is a well-known technique that exploits the broadcast nature of wireless transmissions and path diversity to form the route in an adaptive manner based on cur...
Davide Chiarotto, Osvaldo Simeone, Michele Zorzi
ICASSP
2011
IEEE
14 years 3 months ago
A combined linear programming-maximum likelihood approach to radial velocity data analysis for extrasolar planet detection
In this paper we introduce a new technique for estimating the parameters of the Keplerian model commonly used in radial velocity data analysis for extrasolar planet detection. The...
Prabhu Babu, Petre Stoica