Sciweavers

759 search results - page 26 / 152
» Overlap-Free Regular Languages
Sort
View
CONCUR
2009
Springer
13 years 6 months ago
On Convergence of Concurrent Systems under Regular Interactions
Convergence is often the key liveness property for distributed systems that interact with physical processes. Techniques for proving convergence (asymptotic stability) have been ex...
Pavithra Prabhakar, Sayan Mitra, Mahesh Viswanatha...
IJPP
2011
99views more  IJPP 2011»
13 years 3 months ago
Regular Lattice and Small-World Spin Model Simulations Using CUDA and GPUs
Data-parallel accelerator devices such as Graphical Processing Units (GPUs) are providing dramatic performance improvements over even multicore CPUs for lattice-oriented applicatio...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
DLT
2006
13 years 10 months ago
Prime Decompositions of Regular Languages
We investigate factorizations of regular languages in terms of prime languages. A language is said to be strongly prime decomposable if any way of factorizing the language yields a...
Yo-Sub Han, Kai Salomaa, Derick Wood
XSYM
2005
Springer
84views Database» more  XSYM 2005»
14 years 1 months ago
Patterns and Types for Querying XML Documents
Among various proposals for primitives for deconstructing XML data two approaches seem to clearly stem from practise: path expressions, widely adopted by the database community, an...
Giuseppe Castagna
JMLR
2012
11 years 11 months ago
A Simple Geometric Interpretation of SVM using Stochastic Adversaries
We present a minimax framework for classification that considers stochastic adversarial perturbations to the training data. We show that for binary classification it is equivale...
Roi Livni, Koby Crammer, Amir Globerson