RP
2010
Springer
13 years 9 months ago
2010
Springer
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...
RP
2010
Springer
13 years 9 months ago
2010
Springer
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 ...
RECSYS
2010
ACM
13 years 9 months ago
2010
ACM
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...
HYBRID
2010
Springer
13 years 9 months ago
2010
Springer
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...
HYBRID
2010
Springer
13 years 9 months ago
2010
Springer
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design...
SYSTOR
2010
ACM
13 years 10 months ago
2010
ACM
SSS
2010
Springer
13 years 10 months ago
2010
Springer
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...
SSS
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. This paper presents Combine, a distributed directory protocol for shared objects, designed for large-scale distributed systems. Directory protocols support move requests,...
SSS
2010
Springer
13 years 10 months ago
2010
Springer
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...
SSS
2010
Springer
13 years 10 months ago
2010
Springer
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...