Sciweavers

1650 search results - page 203 / 330
» The HOM problem is decidable
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
Multiple-channel detection of a Gaussian time series over frequency-flat channels
This work addresses the problem of deciding whether a set of realizations of a vector-valued time series with unknown temporal correlation are spatially correlated or not. Speciï¬...
David Ramírez, Javier Vía, Ignacio S...
ICDT
2011
ACM
270views Database» more  ICDT 2011»
14 years 8 months ago
On the equivalence of distributed systems with queries and communication
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
Serge Abiteboul, Balder ten Cate, Yannis Katsis
CONCUR
2009
Springer
15 years 11 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...
IWPEC
2009
Springer
15 years 11 months ago
Improved Induced Matchings in Sparse Graphs
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Wal...
SOUPS
2006
ACM
15 years 10 months ago
Intentional access management: making access control usable for end-users
The usability of access control mechanisms in modern distributed systems has been widely criticized but little studied. In this paper, we carefully examine one such widely deploye...
Xiang Cao, Lee Iverson