Sciweavers

1063 search results - page 22 / 213
» Combining Simple Models to Approximate Complex Dynamics
Sort
View
IJCAI
2007
13 years 9 months ago
Simple Training of Dependency Parsers via Structured Boosting
Recently, significant progress has been made on learning structured predictors via coordinated training algorithms such as conditional random fields and maximum margin Markov ne...
Qin Iris Wang, Dekang Lin, Dale Schuurmans
IMCSIT
2010
13 years 4 months ago
PSO based modeling of Takagi-Sugeno fuzzy motion controller for dynamic object tracking with mobile platform
Modeling of optimized motion controller is one of the interesting problems in the context of behavior based mobile robotics. Behavior based mobile robots should have an ideal contr...
Meenakshi Gupta, Laxmidhar Behera, Venkatesh K. S.
JMLR
2006
117views more  JMLR 2006»
13 years 7 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
ASIACRYPT
2007
Springer
13 years 11 months ago
Simple and Efficient Perfectly-Secure Asynchronous MPC
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
Zuzana Beerliová-Trubíniová, ...
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
14 years 8 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall