Sciweavers

2465 search results - page 129 / 493
» Automata on Linear Orderings
Sort
View
ISAAC
2009
Springer
108views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Linear and Sublinear Time Algorithms for Basis of Abelian Groups
It is well known that every finite abelian group G can be represented as a direct product of cyclic groups: G ∼= G1 × G2 × · · · × Gt, where each Gi is a cyclic group of ...
Li Chen, Bin Fu
ASM
2005
ASM
14 years 2 months ago
Scenario based Analysis of Linear Computations
Abstract. In this paper we consider the following task: given an abstract state machine, characterize the subsets of initial values corresponding to different typical scenarios of...
Vladimir Filatov, Rostislav Yavorskiy
EDBT
2000
ACM
14 years 1 months ago
Spatial Distributions Server Based on Linear Quadtree
The paper presents Spatial Distributions Server – an analytical tool aimed at efficient creation, storing and analyzing of spatial distributions. Methods of approximation of spat...
Piotr Bajerski
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 9 months ago
The Tree Inclusion Problem: In Linear Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been ...
Philip Bille, Inge Li Gørtz
ORL
2008
72views more  ORL 2008»
13 years 9 months ago
Stochastic 0-1 linear programming under limited distributional information
We consider the problem minX{0,1}n {c x : aj x bj , j = 1, . . . , m}, where the aj are random vectors with unknown distributions. The only information we are given regarding the ...
Michael R. Wagner