Sciweavers

210 search results - page 9 / 42
» Uniform regular enumerations
Sort
View
DCG
2000
79views more  DCG 2000»
13 years 7 months ago
Mutation Polynomials and Oriented Matroids
Several polynomials are of use in various enumeration problems concerning objects in oriented matroids. Chief among these is the Radon catalog. We continue to study these, as well ...
J. Lawrence
FSTTCS
2006
Springer
13 years 11 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh
ALT
2010
Springer
13 years 9 months ago
A Regularization Approach to Metrical Task Systems
We address the problem of constructing randomized online algorithms for the Metrical Task Systems (MTS) problem on a metric against an oblivious adversary. Restricting our attenti...
Jacob Abernethy, Peter L. Bartlett, Niv Buchbinder...
DAM
2007
88views more  DAM 2007»
13 years 7 months ago
Hybrid one-dimensional reversible cellular automata are regular
It is shown that the set of hybrid one-dimensional reversible cellular automata (CA) with the periodic boundary condition is a regular set. This has several important consequences...
Jesse D. Bingham, Brad Bingham
FUIN
2008
88views more  FUIN 2008»
13 years 7 months ago
Preferential Regular Path Queries
In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for "scaling" up or down...
Gösta Grahne, Alex Thomo, William W. Wadge