Sciweavers

499 search results - page 20 / 100
» Multilevel algorithms for linear ordering problems
Sort
View
CORR
2012
Springer
210views Education» more  CORR 2012»
12 years 4 months ago
Towards minimax policies for online linear optimization with bandit feedback
We address the online linear optimization problem with bandit feedback. Our contribution is twofold. First, we provide an algorithm (based on exponential weights) with a regret of...
Sébastien Bubeck, Nicolò Cesa-Bianch...
ICDM
2008
IEEE
175views Data Mining» more  ICDM 2008»
14 years 3 months ago
Overlapping Matrix Pattern Visualization: A Hypergraph Approach
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to bes...
Ruoming Jin, Yang Xiang, David Fuhry, Feodor F. Dr...
CORR
2011
Springer
162views Education» more  CORR 2011»
13 years 3 months ago
Isomorphism of regular trees and words
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
Markus Lohrey, Christian Mathissen
ASIACRYPT
2008
Springer
13 years 11 months ago
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...
Mathias Herrmann, Alexander May
ALGORITHMICA
2008
52views more  ALGORITHMICA 2008»
13 years 9 months ago
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
V. Berry, Z. S. Peng, H. F. Ting