1146 search results - page 144 / 230 » Finite cupping sets |
128
Voted
PTS
2007
15 years 5 months ago
2007
Abstract. We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be...
131
click to vote
SIS
2007
15 years 5 months ago
2007
Access control models for XML data can be classified in two major categories: node filtering and query rewriting systems. The first category includes approaches that use access ...
122
click to vote
COMMA
2006
15 years 5 months ago
2006
In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every st...
146
click to vote
FCS
2006
15 years 5 months ago
2006
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
149
click to vote
NIPS
2001
15 years 5 months ago
2001
We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integ...