Sciweavers

205 search results - page 40 / 41
» Complexity of Polynomial Multiplication over Finite Fields
Sort
View
ICAI
2010
13 years 3 months ago
Exact Loopy Belief Propagation on Euler Graphs
Belief propagation is widely used in inference of graphical models. It yields exact solutions when the underlying graph is singly connected. When the graph contains loops, double-c...
Chen-Hsiang Yeang
CCECE
2009
IEEE
14 years 16 days ago
Inverse data transformation for change detection in wind turbine diagnostics
A complex system is expected to show different nominal behaviors under different conditions, and the deviation over time from these nominal behaviors is an indicator of potential ...
Yanjun Yan, Lisa Ann Osadciw, Glen Benson, Eric Wh...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 10 days ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
ECCV
2004
Springer
14 years 7 months ago
The Least-Squares Error for Structure from Infinitesimal Motion
We analyze the least?squares error for structure from motion with a single infinitesimal motion ("structure from optical flow"). We present asymptotic approximations to ...
John Oliensis
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
14 years 5 months ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
Andrey Balmin, Emiran Curtmola