Sciweavers

1897 search results - page 49 / 380
» Mining Chains of Relations
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
14 years 9 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
IOR
2006
163views more  IOR 2006»
14 years 9 months ago
Adaptive Importance Sampling Technique for Markov Chains Using Stochastic Approximation
For a discrete-time finite-state Markov chain, we develop an adaptive importance sampling scheme to estimate the expected total cost before hitting a set of terminal states. This s...
T. P. I. Ahamed, Vivek S. Borkar, S. Juneja
IFIP12
2009
14 years 7 months ago
Mining Retail Transaction Data for Targeting Customers with Headroom - A Case Study
We outline a method to model customer behavior from retail transaction data. In particular, we focus on the problem of recommending relevant products to consumers. Addressing this ...
Madhu Shashanka, Michael Giering
VLDB
1990
ACM
128views Database» more  VLDB 1990»
15 years 1 months ago
Advanced Query Processing in Object Bases Using Access Support Relations
Even though the large body of knowledge of relational query optimization techniques can be utilized as a starting point for object-oriented query optimization the full exploitatio...
Alfons Kemper, Guido Moerkotte
ICRA
1998
IEEE
104views Robotics» more  ICRA 1998»
15 years 2 months ago
The Isoconditioning Loci of A Class of Closed-Chain Manipulators
The subject of this paper is a special class of closedchain manipulators. First, we analyze a family of twodegree-of-freedom (dof) five-bar planar linkages. Two Jacobian matrices ...
Damien Chablat, Philippe Wenger, Jorge Angeles