Sciweavers

7773 search results - page 344 / 1555
» On generalized Frame-Stewart numbers
Sort
View
CAISE
2005
Springer
16 years 7 days ago
A Method for Ontology Modeling in the Business Domain
Today ontology languages present a syntax which looks not “natural” and are lacking of built-in primitives (i.e., modeling notions) domain experts are familiar with. In this pa...
Michele Missikoff, Federica Schiappelli
CCS
2005
ACM
16 years 7 days ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
16 years 6 days ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
ESWS
2005
Springer
16 years 6 days ago
Pedro Ontology Services: A Framework for Rapid Ontology Markup
Semantic Web technologies offer the possibility of increased accuracy and completeness in search and retrieval operations. In recent years, curators of data resources have begun f...
Kevin L. Garwood, Phillip W. Lord, Helen Parkinson...
FCT
2005
Springer
16 years 6 days ago
Deterministic Automata on Unranked Trees
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
Julien Cristau, Christof Löding, Wolfgang Tho...