Sciweavers

RP
2010
Springer
118views Control Systems» more  RP 2010»
13 years 8 months ago
Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
Zdenek Sawa
RP
2010
Springer
163views Control Systems» more  RP 2010»
13 years 8 months ago
Efficient Graph Reachability Query Answering Using Tree Decomposition
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
Fang Wei
RECSYS
2010
ACM
13 years 8 months ago
List-wise learning to rank with matrix factorization for collaborative filtering
A ranking approach, ListRank-MF, is proposed for collaborative filtering that combines a list-wise learning-to-rank algorithm with matrix factorization (MF). A ranked list of item...
Yue Shi, Martha Larson, Alan Hanjalic
HYBRID
2010
Springer
13 years 8 months ago
Oscillation analysis of linearly coupled piecewise affine systems
In recent years, there have been intensive theoretical research works on modeling/analysis of oscillatory phenomena. In this paper, we derive a sufficient condition under which (a...
Kenji Kashima, Yasuyuki Kawamura, Jun-ichi Imura
HYBRID
2010
Springer
13 years 8 months ago
Timed I/O automata: a complete specification theory for real-time systems
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design...
Alexandre David, Kim G. Larsen, Axel Legay, Ulrik ...
SYSTOR
2010
ACM
13 years 9 months ago
Generating low-overhead dynamic binary translators
Mathias Payer, Thomas R. Gross
SSS
2010
Springer
118views Control Systems» more  SSS 2010»
13 years 9 months ago
Modeling and Analyzing Periodic Distributed Computations
The earlier work on predicate detection has assumed that the given computation is finite. Detecting violation of a liveness predicate requires that the predicate be evaluated on a...
Anurag Agarwal, Vijay K. Garg, Vinit A. Ogale
SSS
2010
Springer
103views Control Systems» more  SSS 2010»
13 years 9 months ago
A Provably Starvation-Free Distributed Directory Protocol
Abstract. This paper presents Combine, a distributed directory protocol for shared objects, designed for large-scale distributed systems. Directory protocols support move requests,...
Hagit Attiya, Vincent Gramoli, Alessia Milani
SSS
2010
Springer
128views Control Systems» more  SSS 2010»
13 years 9 months ago
On Transactional Scheduling in Distributed Transactional Memory Systems
We present a distributed transactional memory (TM) scheduler called Bi-interval that optimizes the execution order of transactional operations to minimize conflicts. Bi-interval c...
Junwhan Kim, Binoy Ravindran
SSS
2010
Springer
134views Control Systems» more  SSS 2010»
13 years 9 months ago
Storage Capacity of Labeled Graphs
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang C...