Sciweavers

2713 search results - page 250 / 543
» Parameterized Tree Systems
Sort
View
ICDE
1992
IEEE
116views Database» more  ICDE 1992»
15 years 10 months ago
An Index Implementation Supporting Fast Recovery for the POSTGRES Storage System
This paper presents two algorithms for maintaining Btree index consistency in a DBMS which does not use write-ahead logging (WAL). One algorithm is similar to shadow paging, but i...
Mark Sullivan, Michael A. Olson
ACL
1992
15 years 7 months ago
Recognition of Linear Context-Free Rewriting Systems
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
Giorgio Satta
IJFCS
2008
63views more  IJFCS 2008»
15 years 6 months ago
How to Synchronize the Activity of All Components of a P System?
We consider the problem of synchronizing the activity of all the membranes of a P system. After pointing at the connection with a similar problem dealt with in the field of cellul...
Francesco Bernardini, Marian Gheorghe, Maurice Mar...
WETICE
2009
IEEE
16 years 1 months ago
Search Optimizations in Structured Peer-to-Peer Systems
Abstract—DHT systems are structured overlay networks capable of using P2P resources as a scalable platform for very large data storage applications. However, their efficiency ex...
Nuno Lopes, Carlos Baquero
HICSS
2007
IEEE
94views Biometrics» more  HICSS 2007»
16 years 18 days ago
Fit Perspectives and Theory Building in Information Systems
Our study examines the fit concept in the context of IS planning, a major research stream in the IS literature. Previous research reveals inconsistencies in the IS planning litera...
Victoria Mitchell, Hasan Mohammad, Tracey Stock, X...