Sciweavers

1449 search results - page 156 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
PLANX
2007
15 years 7 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
ACL
2006
15 years 7 months ago
Approximation Lasso Methods for Language Modeling
Lasso is a regularization method for parameter estimation in linear models. It optimizes the model parameters with respect to a loss function subject to model complexities. This p...
Jianfeng Gao, Hisami Suzuki, Bin Yu
FLAIRS
2006
15 years 7 months ago
Learning Personalized Query Modifications
The continuous development of the Internet has resulted in an exponential increase in the amount of available information. A popular way to access this information is by submittin...
Erika E. Torres-Verdín, Manfred Huber
IJCAI
2001
15 years 7 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen
UAI
2001
15 years 7 months ago
A Bayesian Multiresolution Independence Test for Continuous Variables
In this paper we present a method of computing the posterior probability of conditional independence of two or more continuous variables from data, examined at several resolutions...
Dimitris Margaritis, Sebastian Thrun