Sciweavers

298 search results - page 49 / 60
» Computation hierarchy for in-network processing
Sort
View
53
Voted
SISAP
2008
IEEE
98views Data Mining» more  SISAP 2008»
15 years 4 months ago
On Reinsertions in M-tree
In this paper we introduce a new M-tree building method, utilizing the classic idea of forced reinsertions. In case a leaf is about to split, some distant objects are removed from...
Jakub Lokoc, Tomás Skopal
POLICY
2005
Springer
15 years 3 months ago
Automated Decomposition of Access Control Policies
Modern dynamic distributed information systems need access control policies to address controlling access to multiple resources that are distributed. The s may be considered as a ...
Linying Su, David W. Chadwick, Andrew Basden, Jame...
ICDS
2010
IEEE
15 years 2 months ago
Towards Learning Domain Ontology from Legacy Documents
—Learning ontology from text is a challenge in knowledge engineering research and practice. Learning relations between concepts is even more difficult work. However, when conside...
Yijian Wu, Shaolei Zhang, Wenyun Zhao
ESEC
1997
Springer
15 years 1 months ago
Verification of Liveness Properties Using Compositional Reachability Analysis
The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compo...
Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kra...
FGR
2004
IEEE
142views Biometrics» more  FGR 2004»
15 years 1 months ago
On Automated Model-Based Extraction and Analysis of Gait
We develop a new model-based extraction process guided by biomechanical analysis for walking people, and analyse its data for recognition capability. Hierarchies of shape and moti...
David K. Wagg, Mark S. Nixon