Sciweavers

2767 search results - page 141 / 554
» Universal Exponentiation Algorithm
Sort
View
BMCBI
2005
110views more  BMCBI 2005»
14 years 10 months ago
Considerations when using the significance analysis of microarrays (SAM) algorithm
Background: Users of microarray technology typically strive to use universally acceptable data analysis strategies to determine significant expression changes in their experiments...
Ola Larsson, Claes Wahlestedt, James A. Timmons
ICASSP
2011
IEEE
14 years 1 months ago
A Kalman-like algorithm with no requirements for noise and initial conditions
We address a Kalman-like estimator for solving universally the problems of filtering (p = 0), prediction (p > 0), and smoothing (p < 0) of discrete time-varying state-space...
Yuriy S. Shmaliy
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
15 years 4 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
DEXA
2008
Springer
87views Database» more  DEXA 2008»
14 years 12 months ago
Tracking Moving Objects in Anonymized Trajectories
Multiple target tracking (MTT) is a well-studied technique in the field of radar technology, which associates anonymized measurements with the appropriate object trajectories. This...
Nikolay Vyahhi, Spiridon Bakiras, Panos Kalnis, Ga...
AAAI
2006
14 years 11 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche