Sciweavers

1015 search results - page 41 / 203
» An efficient algorithm for AS path inferring
Sort
View
ICML
2010
IEEE
13 years 9 months ago
Accelerated dual decomposition for MAP inference
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
Vladimir Jojic, Stephen Gould, Daphne Koller
NIPS
2004
13 years 9 months ago
Following Curved Regularized Optimization Solution Paths
Regularization plays a central role in the analysis of modern data, where non-regularized fitting is likely to lead to over-fitted models, useless for both prediction and interpre...
Saharon Rosset
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
13 years 8 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...
SAC
2008
ACM
13 years 7 months ago
Bayesian inference for a discretely observed stochastic kinetic model
The ability to infer parameters of gene regulatory networks is emerging as a key problem in systems biology. The biochemical data are intrinsically stochastic and tend to be observ...
Richard J. Boys, Darren J. Wilkinson, Thomas B. L....
DAC
2006
ACM
14 years 9 months ago
An efficient and versatile scheduling algorithm based on SDC formulation
Scheduling plays a central role in the behavioral synthesis process, which automatically compiles high-level specifications into optimized hardware implementations. However, most ...
Jason Cong, Zhiru Zhang