Sciweavers

2869 search results - page 179 / 574
» The Inference Problem: A Survey
Sort
View
VLDB
1994
ACM
101views Database» more  VLDB 1994»
15 years 4 months ago
New Concurrency Control Algorithms for Accessing and Compacting B-Trees
This paper initially presents a brief but fairly exhaustive survey of solutions to the concurrency control problem for B-trees. We then propose a new solution, which is characteri...
V. W. Setzer, Andrea Zisman
76
Voted
AUTOMATICA
2007
61views more  AUTOMATICA 2007»
15 years 28 days ago
Errors-in-variables methods in system identification
Abstract: The paper gives a survey of errors-in-variables methods in system identification. Background and motivation are given, and examples illustrate why the identification pr...
Torsten Söderström
86
Voted
ENTCS
2008
103views more  ENTCS 2008»
15 years 26 days ago
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
M. Praveen, Kamal Lodaya
ACL
2010
14 years 11 months ago
On the Computational Complexity of Dominance Links in Grammatical Formalisms
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
Sylvain Schmitz
101
Voted
SACMAT
2009
ACM
15 years 7 months ago
Safety in discretionary access control for logic-based publish-subscribe systems
Publish-subscribe (pub-sub) systems are useful for many applications, including pervasive environments. In the latter context, however, great care must be taken to preserve the pr...
Kazuhiro Minami, Nikita Borisov, Carl A. Gunter