Sciweavers

7123 search results - page 1340 / 1425
» The Ordered Set of Rough Sets
Sort
View
RTA
2010
Springer
14 years 21 days ago
Termination of linear bounded term rewriting systems
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...
Irène Durand, Géraud Sénizerg...
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
14 years 21 days ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
SOUPS
2010
ACM
14 years 21 days ago
Do windows users follow the principle of least privilege?: investigating user account control practices
The principle of least privilege requires that users and their programs be granted the most restrictive set of privileges possible to perform required tasks in order to limit the ...
Sara Motiee, Kirstie Hawkey, Konstantin Beznosov
DEXA
2009
Springer
188views Database» more  DEXA 2009»
14 years 20 days ago
On-the-Fly Integration and Ad Hoc Querying of Life Sciences Databases Using LifeDB
Data intensive applications in Life Sciences extensively use the Hidden Web as a platform for information sharing. Access to these heterogeneous Hidden Web resources is limited thr...
Anupam Bhattacharjee, Aminul Islam, Mohammad Shafk...
ICCS
2007
Springer
14 years 20 days ago
Building Verifiable Sensing Applications Through Temporal Logic Specification
Abstract. Sensing is at the core of virtually every DDDAS application. Sensing applications typically involve distributed communication and coordination over large self-organized n...
Asad Awan, Ahmed H. Sameh, Suresh Jagannathan, Ana...
« Prev « First page 1340 / 1425 Last » Next »