Sciweavers

Share
SDM
2012
SIAM
293views Data Mining» more  SDM 2012»
7 years 2 months ago
RP-growth: Top-k Mining of Relevant Patterns with Minimum Support Raising
One practical inconvenience in frequent pattern mining is that it often yields a flood of common or uninformative patterns, and thus we should carefully adjust the minimum suppor...
Yoshitaka Kameya, Taisuke Sato
LICS
2012
IEEE
7 years 2 months ago
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
Serge Haddad, Sylvain Schmitz, Philippe Schnoebele...
ACL
2011
8 years 3 months ago
Automatically Evaluating Text Coherence Using Discourse Relations
We present a novel model to represent and assess the discourse coherence of text. Our model assumes that coherent text implicitly favors certain types of discourse relation transi...
Ziheng Lin, Hwee Tou Ng, Min-Yen Kan
JMLR
2010
125views more  JMLR 2010»
8 years 6 months ago
Regret Bounds for Gaussian Process Bandit Problems
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
Steffen Grünewälder, Jean-Yves Audibert,...
CORR
2011
Springer
148views Education» more  CORR 2011»
8 years 7 months ago
On Stabilization in Herman's Algorithm
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics o...
Stefan Kiefer, Andrzej S. Murawski, Joël Ouak...
CORR
2011
Springer
169views Education» more  CORR 2011»
8 years 7 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
CDC
2010
IEEE
120views Control Systems» more  CDC 2010»
8 years 7 months ago
Statistical properties of the error covariance in a Kalman filter with random measurement losses
In this paper we study statistical properties of the error covariance matrix of a Kalman filter, when it is subject to random measurement losses. We introduce a sequence of tighter...
Eduardo Rohr, Damián Marelli, Minyue Fu
CORR
2010
Springer
159views Education» more  CORR 2010»
8 years 9 months ago
Counting Plane Graphs: Flippability and its Applications
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csab...
CORR
2010
Springer
107views Education» more  CORR 2010»
8 years 9 months ago
Metric uniformization and spectral bounds for graphs
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...
PIMRC
2010
IEEE
8 years 9 months ago
Tightness of capacity bounds in correlated MIMO systems with channel estimation error
We consider a point-to-point, correlated and block fading multiple antenna channel where the receiver has a noisy channel estimation and the transmitter has the statistics of the c...
Alkan Soysal
books