Sciweavers

JSC
2010
83views more  JSC 2010»
12 years 11 months ago
Computing differential characteristic sets by change of ordering
We describe an algorithm for converting a characteristic set of a prime differential ideal from one ranking into another. This algorithm was implemented in many different language...
François Boulier, François Lemaire, ...
JSAC
2010
120views more  JSAC 2010»
12 years 11 months ago
Simple movement control algorithm for bi-connectivity in robotic sensor networks
Robotic sensor networks are more powerful than sensor networks because the sensors can be moved by the robots to adjust their sensing coverage. In robotic sensor networks, an impor...
Hai Liu, Xiaowen Chu, Yiu-Wing Leung, Rui Du
JOC
2010
129views more  JOC 2010»
12 years 11 months ago
Discrete Logarithm Problems with Auxiliary Inputs
Let g be an element of prime order p in an abelian group and let Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, the secret key can be computed de...
Jung Hee Cheon
JMMA
2010
90views more  JMMA 2010»
12 years 11 months ago
A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
John Douglas Opdyke
JMLR
2010
111views more  JMLR 2010»
12 years 11 months ago
An EM Algorithm on BDDs with Order Encoding for Logic-based Probabilistic Models
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
Masakazu Ishihata, Yoshitaka Kameya, Taisuke Sato,...
JMLR
2010
102views more  JMLR 2010»
12 years 11 months ago
Discover Local Causal Network around a Target to a Given Depth
For a given target node T and a given depth k 1, we propose an algorithm for discovering a local causal network around the target T to depth k. In our algorithm, we find parents,...
You Zhou, Changzhang Wang, Jianxin Yin, Zhi Geng
JMLR
2010
118views more  JMLR 2010»
12 years 11 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
JMLR
2010
163views more  JMLR 2010»
12 years 11 months ago
Dense Message Passing for Sparse Principal Component Analysis
We describe a novel inference algorithm for sparse Bayesian PCA with a zero-norm prior on the model parameters. Bayesian inference is very challenging in probabilistic models of t...
Kevin Sharp, Magnus Rattray
JMLR
2010
100views more  JMLR 2010»
12 years 11 months ago
Discriminative Topic Segmentation of Text and Speech
We explore automated discovery of topicallycoherent segments in speech or text sequences. We give two new discriminative topic segmentation algorithms which employ a new measure o...
Mehryar Mohri, Pedro Moreno, Eugene Weinstein
JMLR
2010
112views more  JMLR 2010»
12 years 11 months ago
Reduced-Rank Hidden Markov Models
Hsu et al. (2009) recently proposed an efficient, accurate spectral learning algorithm for Hidden Markov Models (HMMs). In this paper we relax their assumptions and prove a tighte...
Sajid M. Siddiqi, Byron Boots, Geoffrey J. Gordon