Sciweavers

986 search results - page 44 / 198
» Algorithmic Lower Bounds for Problems Parameterized by Cliqu...
Sort
View
ALT
2010
Springer
13 years 9 months ago
Inferring Social Networks from Outbreaks
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
Dana Angluin, James Aspnes, Lev Reyzin
IJRR
2000
117views more  IJRR 2000»
13 years 7 months ago
Singularity-Consistent Parameterization of Robot Motion and Control
The inverse kinematics problem is formulated as a parameterized autonomous dynamical system problem, and respective analysis is carried out. It is shown that a singular point of w...
Dragomir N. Nenchev, Yuichi Tsumaki, Masaru Uchiya...
UAI
1998
13 years 9 months ago
Large Deviation Methods for Approximate Probabilistic Inference
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr childjparents depend monotonically on weighted sums of the parents. In larg...
Michael J. Kearns, Lawrence K. Saul
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
11 years 10 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
ECCC
2010
80views more  ECCC 2010»
13 years 7 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...